Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Alexandr Kostochka"'
Publikováno v:
Journal of Graph Theory. 100:578-607
Let $F$ and $H$ be $k$-uniform hypergraphs. We say $H$ is $F$-saturated if $H$ does not contain a subgraph isomorphic to $F$, but $H+e$ does for any hyperedge $e\not\in E(H)$. The saturation number of $F$, denoted $\mathrm{sat}_k(n,F)$, is the minimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfcce58fe4c3ec9b36cfc89a178ad1eb
http://arxiv.org/abs/2202.07149
http://arxiv.org/abs/2202.07149
Publikováno v:
Graphs and Combinatorics. 24:291-301
The Hadwiger number η(G) of a graph G is the largest integer n for which the complete graph K n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, η(G) ≥ χ(G), where χ(G) is the chromatic number of G. In this paper, we
Publikováno v:
Journal of Graph Theory. 57:55-64
Autor:
ALEXANDR KOSTOCHKA, DHRUV MUBAYI
Publikováno v:
Combinatorics, Probability & Computing; Nov2008, Vol. 17 Issue 6, p823-830, 8p
Publikováno v:
Combinatorics, Probability & Computing; Sep2006, Vol. 15 Issue 5, p685-694, 10p
Publikováno v:
Combinatorics, Probability & Computing; Nov2005, Vol. 14 Issue 5/6, p723-736, 14p
Autor:
Alexandr Kostochka
Publikováno v:
Random Structures & Algorithms; Jan2004, Vol. 24 Issue 1, p1-10, 10p
Autor:
ALEXANDR KOSTOCHKA, BENNY SUDAKOV
Publikováno v:
Combinatorics, Probability & Computing; Nov2003, Vol. 12 Issue 5/6, p627-641, 15p
Autor:
Alexandr Kostochka, Gexin Yu
Publikováno v:
Journal of Graph Theory; Dec2005, Vol. 50 Issue 4, p321-339, 0p