András London

collaborators

4 papers

math.CO2026

A Degree-Preserving Builder--Chooser Game

AndrÃ¡s London

We propose a degree-preserving variant of the Builder--Chooser clique game of Pettie, Tardos, and Walczak. In each round, Builder chooses a matching, performs a degree-preserving g…

math.CO2026

Edge partitions into induced- $2 K_{2}$ -free bipartite graphs

AndrÃ¡s London

We study edge partitions of a bipartite graph into induced- $2 K_{2}$ -free bipartite graphs, i.e.\ into Ferrers (chain) graphs. We define $\fp(G)$ as the minimum number of parts in suc…

math.CO2026

Spanning-Tree Extremality in $C_{4}$ -Free Graphs

AndrÃ¡s London, András London

We study the maximum number of spanning trees in connected $n$ -vertex $C_{4}$ -free graphs. For projective-plane orders $n = q^{2} + q + 1$ , we determine the spanning-tree count of every pola…

math.CO2025

Partitions of Graphs into Special Bipartite Graphs

Lajos GyÅrffy, AndrÃ¡s London, GÃ¡bor V. Nagy +1

We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to…

A Degree-Preserving Builder--Chooser Game

Edge partitions into induced-2K2​-free bipartite graphs

Spanning-Tree Extremality in C4​-Free Graphs

Partitions of Graphs into Special Bipartite Graphs

Edge partitions into induced- $2 K_{2}$ -free bipartite graphs

Spanning-Tree Extremality in $C_{4}$ -Free Graphs