Kevin Hendrey

kevinhendrey@ibs.re.kr

Research Interests:

Sructural and Extremal Graph Theory, Combinatorics

Publications:

[1] (with J. P. Gollin, K.-i. Kawarabayashi, O. Kwon and S. Oum)

A unified half integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups,

J. London Math. Soc. 109.1 (2024), e12858.

[arXiv] [publication]

[2] (with D. Chakraborti, B. Lund and C.  Tompkins)

Rainbow saturation for complete graphs,

SIAM J. Discrete Math. 38.1 (2024).

[arXiv] [publication] 

[3] (with J. Balogh, C. Chen, B. Lund, H. Luo, C. Tompkins, and T. Tran)

Maximal 3-wise intersecting families,

Combinatorica 43.6 (2023), pp. 1045-1066.

[arXiv] [MathSciNet] [publication] 

[4] (with R. Campbell, K. Clinch, M. Distel, J. P. Gollin, R. Hickingbotham, T. Huynh, F. Illingworth, Y. Tamitegama, J. Tan and D. R. Wood)

Product structure of graph classes with bounded treewidth,

Combin. Probab. Comput. (2023).

[arXiv] [publication] 

[5] (with R. Campbell, M. Distel, J. P. Gollin, D. J. Harvey, R. Hickingbotham, B. Mohar and D. R. Wood)

Graphs of linear growth have bounded treewidth,

European J. Combin. 30.3 (2023), Paper No. 3.1, 12.

[arXiv] [MathSciNet] [publication]

[6] (with J. P. Gollin, A. Methuku, C. Tompkins and X. Zhang)

Counting cliques in 1-planar graphs,

European J. Combin. 109 (2023), Paper No. 103654, 27.

[arXiv] [MathSciNet] [publication]

[7] (with J. Ahn, D. Kim, S. Oum)

Bounds for the twinwidth of graphs,

SIAM J. Discrete Math.  36.3 (2022), 2352–2366.

[arXiv] [MathSciNet] [publication]

[8] (with S. Norin, D. R. Wood)

Extremal functions for sparse minors,

Advances in Combinatorics, 43 (2022), Paper No. 5.

[arXiv] [MathSciNet] [editorial introduction]

[9] (with J. P. Gollin, D. Mayhew, S. Oum)

Obstructions for bounded branch-depth in matroids,

Advances in Combinatorics 4 (2021), 25pp.

[arXiv] [MathSciNet] [editorial introduction]

[10] (with I. M. Wanless)

 Covering radius in the Hamming permutation space,

European J. Combin. 84 (2020), 9pp.

[arXiv] [MathSciNet] [publication]

[11]     (with D. R. Wood)

Defective and clustered colouring of sparse graphs,

Combin. Probab. Comput.  28.5 (2010), 791-810. 

[arXiv] [MathSciNet][publication]

[12] Sparse graphs of high gonality,

SIAM J. Discrete Math.  32.2 (2018), 1400-1407.

[arXiv] [MathSciNet][publication]

[13] (with D. Best,  I. M. Wanless, T.E. Wilson, D.R. Wood)

Transversals in Latin arrays with many distinct symbols, 

J. Combinatorial Designs 26.2 (2018), 84–96. 

[arXiv] [MathSciNet] [publication]

[14] (with D. R. Wood)

The extremal function for Petersen minors, 

J. Combinatorial Theory Series B 131 (2018), 220–253. 

[arXiv] [MathSciNet] [publication] 

Preprints:

[1] (with J. P. Gollin, S. Oum and B. Reed)

Linear bounds on treewidth in terms of excluded planar minors, 2024.

[arXiv]

[2] (with J. Ahn, D. Chakraborti and S. Oum)

Twin-width of subdivisions of multigraphs, 2023
[arXiv]

[3] (with A. Girão, F. Illingworth, F. Lehner,  L. Michel, M. Savery and R. Steiner)

Chromatic number is not tournament-local, 2023.

[arXiv]

[4] (with S. Norin, R. Steiner and J. Turcotte)

Finding dense minors using average degree, 2023.

[arXiv]

[5] (with S. Norin, R. Steiner and J. Turcotte)

On an induced version of Menger's theorem, 2023.

[arXiv]

[6] (with S. Norin, R. Steiner and J. Turcotte)

Twin-width of sparse random graphs, 2023.

[arXiv]

[7] (with J. Ahn, D. Chakraborti, D. Kim, and S. Oum)

Twin-width of random graphs, 2022.

[arXiv]

[8] (with J. P. Gollin, O. Kwon, S. Oum and Y. Yoo)

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, 2022.

[arXiv]