3 papers
math.CO2025
On the Prague dimension of sparse random graphs
Felix Joos, LetÃcia Mattos
The Prague dimension of a graph is defined as the minimum number of complete graphs whose direct product contains as an induced subgraph. Introduced in the 1970s by NešetŅ
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 -uniform hypergraphs (-graphs for short). Here, a -graph property is testable if there is a r…
math.CO2024
Sufficient conditions for perfect mixed tilings
Eoin Hurley, Felix Joos, Richard Lang
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs with components of sublinear order. As…