Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Karl, J��nos"'
Autor:
Karl, J��nos, T��th, G��za
The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that ${\mbox{cr}}(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9965f44683c13ed12a68641f91a93fb
We consider a natural generalisation of Tur��n's forbidden subgraph problem and the Ruzsa-Szemer��di problem by studying the maximum number $ex_F(n,G)$ of edge-disjoint copies of a fixed graph $F$ can be placed on an $n$-vertex ground set wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57e097462797841a01e59e857bb64262