Showing math.COShow all
3 papers · 1 filter
math.CO2026
On Ramsey-type problems for paths and cycles with few colour changes
Peter Allen, Julia Böttcher, Dennis Clemens +3
In 1967, Gerencser and Gyárfás determined the exact values of the two-colour Ramsey numbers of paths. In a footnote, they made the following observation: Every -edge-coloured…
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.CO2024
Randomized algorithms to generate hypergraphs with given degree sequences
Michela Ascolese, Matthias Lienau, Matthias Schulte +1
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by…