Cover Image

The ineffectiveness of the regularity lemma for bounded degree graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lyons, Clark, Terlov, Grigory, Vidnyánszky, Zoltán
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

FIID homomorphisms and entropy inequalities
by: Csoka, Endre, et al.
Published: (2024)

From descriptive to distributed
by: Grebík, Jan, et al.
Published: (2025)

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

On Homomorphism Graphs
by: Brandt, Sebastian, et al.
Published: (2021)

Growth of regular partitions 1: Improved bounds for small slicewise VC-dimension
by: Terry, C.
Published: (2024)

Complexity of Linear Equations and Infinite Gadgets
by: Grebík, Jan, et al.
Published: (2025)

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
by: Fu, Yayi
Published: (2023)

Zarankiewicz bounds from distal regularity lemma
by: Tong, Mervyn
Published: (2024)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Growth of regular partitions 2: Weak regularity
by: Terry, C.
Published: (2024)

Growth of regular partitions 4: strong regularity and the pairs partition
by: Terry, C.
Published: (2024)

Growth of regular partitions 3: strong regularity and the vertex partition
by: Terry, C.
Published: (2024)

Ramsey theory of low-degree semialgebraic relations
by: Adibelli, Azem, et al.
Published: (2026)

Whitney's 2-isomorphism theorem for graphings
by: Borbényi, Márton, et al.
Published: (2026)

Continuous stable regularity
by: Chavarria, Nicolas, et al.
Published: (2021)

Limiting distributions of triangle counts in linear preferential attachment models
by: Dey, Partha S., et al.
Published: (2026)

Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
by: Balko, Martin, et al.
Published: (2021)

Measurable one-ended spanning trees
by: Bowen, Matt, et al.
Published: (2025)

Higher-order generalizations of stability and arithmetic regularity
by: Terry, C., et al.
Published: (2021)

Embeddability of graphs and Weihrauch degrees
by: Cipriani, Vittorio, et al.
Published: (2023)

Borel line graphs
by: Anderson, James, et al.
Published: (2023)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

New bounds on the strength of some restrictions of Hindman's Theorem
by: Carlucci, Lorenzo, et al.
Published: (2017)

Incidence bounds in positive characteristic via valuations and distality
by: Bays, Martin, et al.
Published: (2021)

Borel fractional perfect matchings in quasi-transitive amenable graphs
by: Murray, Sam
Published: (2025)

The structure of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC}_2$-dimension
by: Terry, C., et al.
Published: (2025)

Local and global $d$-rigidity are not definable in the first order logic of graphs
by: Bernstein, Daniel Irving, et al.
Published: (2025)

On the linear complexity of subsets of $\mathbb{F}_p^n$ bounded $\textrm{VC}_2$-dimension
by: Sheats, Hannah, et al.
Published: (2025)

On the quadratic complexity of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC_{2}}$-dimension
by: Terry, C., et al.
Published: (2025)

Hyper-hyperfiniteness and complexity
by: Frisch, Joshua, et al.
Published: (2024)

Hyperfiniteness on Topological Ramsey Spaces
by: Bursics, Balázs, et al.
Published: (2024)

Stabilizers and NIP arithmetic regularity
by: Conant, G., et al.
Published: (2025)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

An analytic version of stable arithmetic regularity
by: Conant, Gabriel, et al.
Published: (2024)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

Decomposition of degree-regular graphs into quasi-random pairs without the Regularity lemma
by: Csaba, Béla
Published: (2026)

A logical limit law for the sequential model of preferential attachment graphs
by: Özdemir, Alperen
Published: (2024)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)