The following pages link to Kevin Hendrey (Q1748272):
Displayed 19 items.
- The extremal function for Petersen minors (Q1748273) (← links)
- Covering radius in the Hamming permutation space (Q2011145) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Sparse Graphs of High Gonality (Q4568093) (← links)
- Transversals in Latin Arrays with Many Distinct Symbols (Q4642158) (← links)
- Bounds for the Twin-Width of Graphs (Q5043639) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Extremal functions for sparse minors (Q5871274) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Rainbow Saturation for Complete Graphs (Q6130540) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
- Product structure of graph classes with bounded treewidth (Q6401220) (← links)
- A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups (Q6411312) (← links)
- Chromatic number is not tournament-local (Q6437889) (← links)
- Twin-width of subdivisions of multigraphs (Q6439686) (← links)
- Finding dense minors using average degree (Q6442448) (← links)
- On an induced version of Menger's theorem (Q6451194) (← links)
- Twin-width of sparse random graphs (Q6462484) (← links)