2 papers
math.CO2025
Combinatorial Methods in Bootstrap Percolation Problems
Gábor V. Nagy, Ákos Süli
An elegant bootstrap percolation result on the hyperrectangle graph was proved by Balogh, Bollobás, Morris, and Riordan using a linear algebric method in 2012. This paper studies t…
math.CO2024
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…