42 citations · 275 across the 72 of their papers we have counts for
9 papers · 1 filter
Hypergraphs not containing a tight tree with a bounded trunk
Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2
An -uniform hypergraph is a tight -tree if its edges can be ordered so that every edge contains a vertex that does not belong to any preceding edge and the set …
Tight paths in convex geometric hypergraphs
Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generali…
Cubic graphs with small independence ratio
József Balogh, Alexandr Kostochka, Xujun Liu
Let denote the infimum of the ratio over the -regular graphs of girth at least , where is the independence number of , and let $i(r,\…
A sharp Dirac-Erdős type bound for large graphs
Henry A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
Let be an integer, be the number of vertices of degree at least in a graph , and be the number of vertices of degree at most in $…
On differences between DP-coloring and list coloring
Anton Bernshteyn, Alexandr Kostochka
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle. Many known upper bounds for the list-chromatic nu…
Stability in the Erdős--Gallai Theorem on cycles and paths, II
Zoltán Füredi, Alexandr Kostochka, Ruth Luo +1
The Erdős--Gallai Theorem states that for , any -vertex graph with no cycle of length at least has at most edges. A stronger version of the…