15 citations · 73 across the 38 of their papers we have counts for
5 papers · 1 filter
Maximal -wise intersecting families
József Balogh, Ce Chen, Kevin Hendrey +4
A family on ground set is maximal -wise intersecting if every collection of at most sets in has non-empty intersection,…
Bounds for the Twin-width of Graphs
Jungho Ahn, Kevin Hendrey, Donggyu Kim +1
Bonnet, Kim, Thomassé, and Watrigant (2020) introduced the twin-width of a graph. We show that the twin-width of an -vertex graph is less than $(n+\sqrt{n\ln n}+\sqrt{n}+2\ln n)…
Counting cliques in -planar graphs
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2
The problem of maximising the number of cliques among -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…
Extremal functions for sparse minors
Kevin Hendrey, Sergey Norin, David R. Wood
The "extremal function" of a graph is the supremum of densities of graphs not containing as a minor, where the "density" of a graph is the ratio of the number of…
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi +2
Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does n…