Showing results 3 to 9 of 9
BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, SIAM JOURNAL ON DISCRETE MATHEMATICS, v.30, no.2, pp.895 - 911, 2016 |
Forbidding induced even cycles in a graph: Typical structure and counting Kim, Jaehoon; Kuehn, Daniela; Osthus, Deryk; Townsend, Timothy, JOURNAL OF COMBINATORIAL THEORY SERIES B, v.131, pp.170 - 219, 2018-07 |
Hypergraph regularity and random sampling Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, RANDOM STRUCTURES & ALGORITHMS, v.62, no.4, pp.956 - 1015, 2023-07 |
Optimal packings of bounded degree trees Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.21, no.12, pp.3573 - 3647, 2019-10 |
Rainbow structures in locally bounded colorings of graphs Kim, Jaehoon; Kuhn, Daniela; Kupavskii, Andrey; Osthus, Deryk, RANDOM STRUCTURES & ALGORITHMS, v.56, no.4, pp.1171 - 1204, 2020-07 |
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs![]() Condon, Padraig; Diaz, Alberto Espuny; Kuhn, Daniela; Osthus, Deryk; Kim, Jaehoon, ELECTRONIC JOURNAL OF COMBINATORICS, v.26, no.4, pp.1 - 22, 2019-12 |
Resolution of the Oberwolfach problem Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, v.23, no.8, pp.2511 - 2547, 2021-08 |
Discover