Showing results 1 to 8 of 8
A characterization of testable hypergraph properties Joos, Felix; Kim, Jaehoon; Kuhn, Daniela; Osthus, Deryk, 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017, pp.859 - 867, IEEE Computer Society Technical Committee on the Mathematical Foundations of Computing (TCMF), 2017-10-16 |
Conflict-free hypergraph matchings Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Marcus; Lichev, Lyuben, ACM-SIAM Symposium on Discrete Algorithms (SODA23), pp.2991 - 3005, Society for Industrial and Applied Mathematics, 2023-01-24 |
Conflict-free hypergraph matchings Glock, Stefan; Joos, Felix; Kim, Jaehoon; Kühn, Marcus; Lichev, Lyuben, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, v.109, no.5, 2024-05 |
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 |
On a rainbow version of Dirac's theorem Joos, Felix; Kim, Jaehoon, BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, v.52, no.3, pp.498 - 504, 2020-06 |
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 |
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 |
Spanning trees in randomly perturbed graphs Joos, Felix; Kim, Jaehoon, RANDOM STRUCTURES & ALGORITHMS, v.56, no.1, pp.169 - 219, 2020-01 |
Discover