3 papers
math.CO2025
Hypergraphs with uniform Turán density equal to 8/27
Frederik Garbe, Daniel IľkoviÄ, Daniel Kráľ +2
In the 1980s, ErdÅs and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph is the…
math.CO2025
Ramsey multiplicity of apices of trees
Daniel Kráľ, Matjaž Krnc, Ander Lamaison
A graph is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of contained in any -edge-coloring of , is asymptotically the same as…
math.CO2025
Closure property of contraction-depth of matroids
Marcin Brianski, Daniel Kral, Ander Lamaison
Contraction-depth is a matroid depth parameter analogous to tree-depth of graphs. We establish the matroid analogue of the classical graph theory result asserting that the tree…