Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Cecchelli, Domenico Mergoni"'
Autor:
Díaz, Alberto Espuny, Gupta, Pranshu, Cecchelli, Domenico Mergoni, Parczyk, Olaf, Sgueglia, Amedeo
We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and has applica
Externí odkaz:
http://arxiv.org/abs/2407.05889
Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a stronger r
Externí odkaz:
http://arxiv.org/abs/2302.01875
The square $G^2$ of a graph $G$ is the graph on $V(G)$ with a pair of vertices $uv$ an edge whenever $u$ and $v$ have distance $1$ or $2$ in $G$. Given graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the minimum $N$ such that whenever the edges of
Externí odkaz:
http://arxiv.org/abs/2212.14860
We denote by $\text{ex}(n, H, F)$ the maximum number of copies of $H$ in an $n$-vertex graph that does not contain $F$ as a subgraph. Recently, Grzesik, Gy\H{o}ri, Salia, Tompkins considered conditions on $H$ under which $\text{ex}(n, H, K_r)$ is asy
Externí odkaz:
http://arxiv.org/abs/2207.14297
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.