scientific article; zbMATH DE number 2086426

zbMath1054.68103MaRDI QIDQ4736881

Endre Szemerédi, Ali Shokoufandeh, János Komlós, Miklós Simmonovits

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2292/22920084.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On the Erdős–Sós conjecture for trees with bounded degree, Additive approximation of generalized Turán questions, Small subsets inherit sparse \(\varepsilon\)-regularity, On the Interplay Between Strong Regularity and Graph Densification, Product of Simplices and sets of positive upper density in ℝ^d, Turán's theorem for pseudo-random graphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, A unified view of graph regularity via matrix decompositions, New upper bounds for Ramsey numbers of books, Linear Ramsey Numbers for Bounded-Degree Hypergrahps, Embedding spanning subgraphs of small bandwidth, 4-cycles in mixing digraphs, Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result, Loebl-Komlós-Sós conjecture: dense case, Fractional Helly theorem for Cartesian products of convex sets, Some Cubic Time Regularity Algorithms for Triple Systems, Sparse partition universal graphs for graphs of bounded degree, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Maximum and Minimum Degree Conditions for Embedding Trees, Induced saturation number, Hamilton cycles in dense vertex-transitive graphs, On the KŁR conjecture in random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Noisy random graphs and their laplacians, Note on the 3-graph counting Lemma, The critical window for the classical Ramsey-Turán problem, Enomoto and Ota's conjecture holds for large graphs, A removal lemma for systems of linear equations over finite fields, Recognizing linear structure in noisy matrices, Generalizations of the removal lemma, Quasirandomness in hypergraphs, A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma, The Brown-Erdős-Sós conjecture in finite abelian groups, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Counting Gallai 3-colorings of complete graphs, Degree Conditions for Embedding Trees, A tight bound for hypergraph regularity, Ramsey numbers of books and quasirandomness, Ramsey numbers for bipartite graphs with small bandwidth