George Kontogeorgiou

collaborators

7 papers

math.CO2026

Monochromatic components in dense 2-edge-coloured balanced bipartite graphs

César Bispo, George Kontogeorgiou, Marcelo Lage +2

We prove that each $2$ -edge-coloured spanning subgraph $G$ of $K_{n, n}$ with $δ (G) \geq ⌊(2 n + 1) /3 ⌋$ can be covered by at most three monochromatic components. We provide…

math.GR2026

Quasirandomness and Uniform Twin-Width

George Kontogeorgiou, Bobby Miraftab

For every nontrivial finite group, we prove that its quasirandom degree gives a polynomial lower bound on its uniform twin-width, whereas its minimum faithful complex representatio…

math.GR2026

Accessibility and Twin-width

George Kontogeorgiou, Bobby Miraftab

We show that finite twin-width does not imply accessibility for finitely generated groups, which answers a question of Esperet. That is, we prove that there exists a finitely gener…

math.CO2026

Rainbow Separating Path Systems

Alexander Clifton, George Kontogeorgiou, S Taruni +1

We introduce a colorful version of separating path systems, in which two edges can only be separated from each other by two paths of distinct colors. We calculate the minimum sizes…

math.CO2025

Separating path systems for cubic graphs and for complete bipartite graphs

Cristina Fernandes, Carlos Hoppen, George Kontogeorgiou +2

A strongly separating path system in a graph $G$ is a collection $P$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$ , there is a paths in $P$ …

math.CO2025

Separating edges by linearly many subdivisions

George Kontogeorgiou, Matias Pavez-Signe, Maya Stein +2

We prove that for any two graphs $G$ and $H$ , the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conj…