Cover Image

Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Csaba, Béla
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A stability theorem for embedding bounded degree spanning trees
by: Csaba, Béla
Published: (2026)

The ineffectiveness of the regularity lemma for bounded degree graphs
by: Lyons, Clark, et al.
Published: (2025)

On the Ramsey-Turán problem for 4-cliques
by: Csaba, Béla
Published: (2025)

The net-regular strongly regular signed graphs with degree 5
by: Yu, Qian, et al.
Published: (2025)

The net-regular strongly regular signed graphs with degree 6
by: Yu, Qian, et al.
Published: (2025)

Expected degrees in random plane graphs
by: Lovvorn, Neely, et al.
Published: (2024)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

Decompositions of graphs with degree constraints relative to prescribed subgraphs
by: Wei, Peichao, et al.
Published: (2025)

Embedding theorems for random graphs with specified degrees
by: Gao, Pu, et al.
Published: (2023)

Blow-up lemmas for sparse graphs
by: Allen, Peter, et al.
Published: (2016)

An arithmetic algebraic regularity lemma
by: Pillay, Anand, et al.
Published: (2024)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)

Decomposing random regular graphs into stars
by: Delcourt, Michelle, et al.
Published: (2023)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)

Tree tilings in random regular graphs
by: Diskin, Sahar, et al.
Published: (2024)

Jaeger-type orientations of random regular graphs
by: Greenhill, Catherine, et al.
Published: (2026)

Clique factors in random samplings of regular graphs
by: Sun, Wanting, et al.
Published: (2025)

Maximum induced trees and forests of bounded degree in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2024)

Some lemmas on spectral radius of graphs: including an application
by: Zhang, Wenqian
Published: (2026)

Sprinkling with random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

On the degrees of regular nut graphs and Cayley nut graphs
by: Bašić, Nino, et al.
Published: (2024)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Decompositions of some classes of regular graphs into cycles and paths of length eight
by: C, Cecily Sahai., et al.
Published: (2023)

The maximum degree of the $r$th power of a sparse random graph
by: Frieze, Alan, et al.
Published: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Decomposition of toroidal graphs without some subgraphs
by: Wang, Tao, et al.
Published: (2025)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

Semiorders induced by uniform random points
by: Biró, Csaba, et al.
Published: (2025)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

Spanning trees of bounded degree in random geometric graphs
by: Anastos, Michael, et al.
Published: (2025)

Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)

Do random initial degrees suppress concentration in preferential attachment graphs?
by: Makai, T., et al.
Published: (2024)

Monotonicity and decompositions of random regular graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
by: Diskin, Sahar, et al.
Published: (2024)

The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
by: Baker, Matthew, et al.
Published: (2025)

A non-flag arithmetic regularity lemma and counting lemma
by: Altman, Daniel
Published: (2022)