Deryk Osthus

collaborators

3 papers

math.CO2025

A characterization of testable hypergraph properties

Felix Joos, Jaehoon Kim, Daniela KÃ¼hn +1

We provide a combinatorial characterization of all testable properties of $k$ -uniform hypergraphs ( $k$ -graphs for short). Here, a $k$ -graph property $P$ is testable if there is a r…

math.CO2024

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

Dong Yeap Kang, Tom Kelly, Daniela KÃ¼hn +2

In 1977, ErdÅs asked the following question: for any integers $t, n \in N$ , if $G_{1}, \dots, G_{n}$ are complete graphs such that each $G_{i}$ has at most $n$ vertices and ev…

math.CO2024

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs

Dong Yeap Kang, Daniela KÃ¼hn, Abhishek Methuku +1

Let $H$ be a $k$ -uniform $D$ -regular simple hypergraph on $N$ vertices. Based on an analysis of the RÃ¶dl nibble, Alon, Kim and Spencer (1997) proved that if $k \geq 3$ , then $H$ co…

A characterization of testable hypergraph properties

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree