Regular partitions of gentle graphs
From MaRDI portal
Publication:2216929
DOI10.1007/s10474-020-01074-xzbMath1463.05455arXiv2003.11692OpenAlexW3044945156MaRDI QIDQ2216929
Patrice Ossona de Mendez, Yiting Jiang, Jaroslav Nešetřil, Sebastian Siebertz
Publication date: 18 December 2020
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.11692
Structural characterization of families of graphs (05C75) Classification theory, stability, and related concepts in model theory (03C45) Applications of model theory (03C98)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly polynomial sequences as interpretations
- Sparsity. Graphs, structures, and algorithms
- The structure of almost all graphs in a hereditary property
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Ramsey-type theorems
- Szemerédi's lemma for the analyst
- On low tree-depth decompositions
- On locally presented posets
- Second-order quantifiers and the complexity of theories
- Ramanujan graphs
- On a product dimension of graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Bi-complement reducible graphs
- Induced subdivisions and bounded expansion
- A tight lower bound for Szemerédi's regularity lemma
- Vertex-minors and the Erdős-Hajnal conjecture
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
- Bounds for graph regularity and removal lemmas
- Distal and non-distal NIP theories
- Regularity lemma for distal structures
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Grad and classes with bounded expansion. I: Decompositions
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Tree-depth, subgraph coloring and homomorphism bounds
- Approximating clique-width and branch-width
- Stable theories
- Crossing patterns of semi-algebraic sets
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- A note on “Regularity lemma for distal structures”
- Structural sparsity
- When Trees Grow Low: Shrubs and Fast MSO1
- Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- An arithmetic regularity lemma, associated counting lemma, and applications
- Regularity partitions and the topology of graphons
- Overlap properties of geometric expanders
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Expander graphs and their applications
- Stable graphs
- The Algorithmic Aspects of the Regularity Lemma
- Szemerédi’s Regularity Lemma for Sparse Graphs
- On the number of types in sparse graphs
- Linear rankwidth meets stability
- MODEL THEORY AND MACHINE LEARNING
- Externally definable sets and dependent pairs II
- A Guide to NIP Theories
- Density and regularity theorems for semi-algebraic hypergraphs
- Regularity lemmas for stable graphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- A Combinatorial Theorem for Trees
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On a problem of K. Zarankiewicz
- On low rank-width colorings
This page was built for publication: Regular partitions of gentle graphs
