3 papers
math.CO2025
Separating edges by linearly many subdivisions
George Kontogeorgiou, Matias Pavez-Signe, Maya Stein +2
We prove that for any two graphs and , the edges of can be strongly separated by a collection of linearly many subdivisions of and single edges. This confirms a conj…
math.CO2025
Antidirected trees in directed graphs
George Kontogeorgiou, Giovanne Santos, Maya Stein
The Komlós-Sárközy-Szemerédi (KSS) theorem establishes that a certain bound on the minimum degree of a graph guarantees it contains all bounded degree trees of the same order. Rece…
math.CO2024
Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques
George Kontogeorgiou, Maya Stein
We prove an upper bound of for the strong separation number of the complete graph , and an upper bound of for its weak separation number. This improves on the prev…