scientific article; zbMATH DE number 878896
From MaRDI portal
Publication:4878666
applicationextremal graphHamiltonian cycleshypergraphlarge subgraphsRamsey numberrandomnessregularity lemmaspanning subgraphs
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)
Recommendations
- scientific article; zbMATH DE number 2086426
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Szemerédi's regularity Lemma for matrices and sparse graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Regularity lemmas for graphs
- Applications of the regularity lemma for uniform hypergraphs
- A graph-theoretic generalization of the Sauer-Shelah lemma
- Regularity lemmas for stable graphs
- Szemerédi's regularity lemma revisited
Cited in
(only showing first 100 items - show all)- On the Ramsey number of sparse 3-graphs
- A combinatorial proof of the removal lemma for groups
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- The 3-colored Ramsey number of even cycles
- Triangle packings and 1-factors in oriented graphs
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
- Highly connected coloured subgraphs via the regularity Lemma
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Cycle factors in dense graphs
- Partitioning complete bipartite graphs by monochromatic cycles
- A Tverberg-type result on multicolored simplices
- On a tiling conjecture of Komlós for 3-chromatic graphs.
- Vertex partitions by connected monochromatic k-regular graphs
- Proof of an entropy conjecture of Leighton and Moitra
- Lower bounds for the smallest singular value of structured random matrices
- On the complexity of finite subgraphs of the curve graph
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Distributing pairs of vertices on Hamiltonian cycles
- Vertex covering with monochromatic pieces of few colours
- Edges not in any monochromatic copy of a fixed graph
- Bipartite Ramsey numbers for graphs of small bandwidth
- A removal lemma for systems of linear equations over finite fields
- Measuring instance difficulty for combinatorial optimization problems
- Star-critical Ramsey numbers for large generalized fans and books
- Bounding the strong chromatic index of dense random graphs
- Almost-spanning subgraphs with bounded degree in dense graphs
- Large generalized books are \(p\)-good
- Strong edge colorings of uniform graphs
- Bounds for graph regularity and removal lemmas
- The number of 3-SAT functions
- Extremal problems and results related to Gallai-colorings
- Non-Hermitian random matrices with a variance profile. I: Deterministic equivalents and limiting esds
- \(K_r\)-factors in graphs with low independence number
- Regularity lemmas for clustering graphs
- \(p\)-arrangeable graphs are Folkman linear
- Ramsey numbers of large books and bipartite graphs with small bandwidth
- An extension of the rainbow Erdős-Rothschild problem
- Monochromatic square-cycle and square-path partitions
- Small rainbow cliques in randomly perturbed dense graphs
- Threshold Ramsey multiplicity for paths and even cycles
- Star-critical Ramsey numbers involving large books
- Ramsey numbers of fans and large books
- Tilings in vertex ordered graphs
- Remarks on an edge-coloring problem
- Multicolor Turán numbers
- On a colored Turán problem of Diwan and Mubayi
- The minimum degree threshold for perfect graph packings
- Powers of Hamilton cycles of high discrepancy are unavoidable
- The linear Turán number of small triple systems or why is the wicket interesting?
- Long monochromatic paths and cycles in 2-colored bipartite graphs
- A degree sequence version of the Kühn-Osthus tiling theorem
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Regular partitions of gentle graphs
- Minimum degree conditions for monochromatic cycle partitioning
- Turán and Ramsey numbers in linear triple systems
- On vertex-induced weighted Turán problems
- Keisler's order is not simple (and simple theories may not be either)
- A weighted regularity lemma with applications
- On the relation of separability, bandwidth and embedding
- Minimal Ramsey graphs on deleting stars for generalized fans and books
- Matchings with few colors in colored complete graphs and hypergraphs
- Ramsey numbers for bipartite graphs with small bandwidth
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Packing tripods: narrowing the density gap
- Monochromatic cycle power partitions
- Additive approximation for edge-deletion problems
- Stability for vertex cycle covers
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Asymptotic multipartite version of the Alon-Yuster theorem
- A counting lemma for binary matroids and applications to extremal problems
- Extremal results in sparse pseudorandom graphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Almost given length cycles in digraphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Nearly equal distances and Szemerédi's regularity lemma
- Reconstruction of Kauffman networks applying trees
- A degree sequence Hajnal-Szemerédi theorem
- Large planar subgraphs in dense graphs
- Extremal connectivity for topological cliques in bipartite graphs
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Graphs with many edge-colorings such that complete graphs are rainbow
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- A hypergraph blow-up lemma
- Stable group theory and approximate subgroups
- Tiling directed graphs with tournaments
- Embedding graphs having Ore-degree at most five
- Small complete minors above the extremal edge density
- Triangle-tilings in graphs without large independent sets
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Vertex Ramsey properties of randomly perturbed graphs
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- On edge-ordered Ramsey numbers
- A Folkman linear family
- Monochromatic cycle partitions of graphs with large minimum degree
- What is the furthest graph from a hereditary property?
- An Ore-type theorem on Hamiltonian square cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878666)
