3 papers
math.CO2026
The density of graphs with no -path connecting equal-degree vertices: a short proof
Yamaan Attwa, Matías Azócar Carvajal, Simona Boyadzhiyska +2
Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree…
math.CO2021
Density maximizers of layered permutations
Adam Kabela, Daniel Kral, Jonathan A. Noel +1
A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if is a layered permutation, then the density of in a permutation of order i…
math.CO2020
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.