42 citations · 275 across the 72 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 3 cited
On perfect packings in dense graphs
József Balogh, Alexandr V. Kostochka, Andrew Treglown
We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfec…
math.CO2011★ 1 cited
Choosability with separation of complete multipartite graphs and hypergraphs
Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat
For a hypergraph G and a positive integer s, let χ_{\ell} (G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v\in V(G) and |L(u)\ca…