42 citations · 275 across the 72 of their papers we have counts for
3 papers · 1 filter
Turan Problems and Shadows I: Paths and Cycles
Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraëte
A -path is a hypergraph P_k = e_1,e_2,...,e_k such that |e_i \cap e_j| = 1 if |j - i| = 1 and e_i \cap e_j is empty otherwise. A k-cycle is a hypergraph C_k = e_1,e_2,.. ,e_k ob…
Planar 4-critical graphs with four triangles
Oleg V. Borodin, Zdeněk Dvořák, Alexandr V. Kostochka +2
By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical…
Minimal abundant packings and choosability with separation
Zoltan Furedi, Alexandr Kostochka, Mohit Kumbhat
A packing of size is a system of subsets (blocks) of a -element underlying set such that each block has elements and every -set is contained in at most…