scientific article; zbMATH DE number 878896

Publication date: 21 November 1996

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

hypergraph Ramsey number regularity lemma Hamiltonian cycles spanning subgraphs randomness extremal graph application large subgraphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An Asymptotic Multipartite Kühn--Osthus Theorem, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Triangles in randomly perturbed graphs, NOTES ON THE STABLE REGULARITY LEMMA, Stability for the Erdős-Rothschild problem, Packing tripods: narrowing the density gap, A Folkman Linear Family, Monochromatic cycle power partitions, Threshold Ramsey multiplicity for odd cycles, Large Rainbow Cliques in Randomly Perturbed Dense Graphs, Triangle-Tilings in Graphs Without Large Independent Sets, Dirac-type results for tilings and coverings in ordered graphs, Counting H-free orientations of graphs, On model selection for dense stochastic block models, Additive approximation for edge-deletion problems, The linear Turán number of small triple systems or why is the wicket interesting?, Stability for vertex cycle covers, On the Interplay Between Strong Regularity and Graph Densification, On graphs with a large number of edge-colorings avoiding a rainbow triangle, Asymptotic multipartite version of the Alon-Yuster theorem, Long monochromatic paths and cycles in 2-colored bipartite graphs, Embedding clique-factors in graphs with low \(\ell\)-independence number, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Graph Tilings in Incompatibility Systems, On Two Problems in Ramsey--Turán Theory, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Bounded-Degree Spanning Trees in Randomly Perturbed Graphs, A Rainbow Erdös--Rothschild Problem, A degree sequence version of the Kühn-Osthus tiling theorem, The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On Regularity Lemmas and their Algorithmic Applications, What is the furthest graph from a hereditary property?, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, 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, Exact Ramsey numbers of odd cycles via nonlinear optimisation, Regularity lemmas in a Banach space setting, Extremal results in sparse pseudorandom graphs, Regular partitions of gentle graphs, Minimum degree conditions for monochromatic cycle partitioning, Turán and Ramsey numbers in linear triple systems, Hypergraph sequences as a tool for saturation of ultrapowers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Two Conjectures in Ramsey--Turán Theory, A sparse regular approximation lemma, An approximate version of the Loebl-Komlós-Sós conjecture, On vertex-induced weighted Turán problems, Keisler's order is not simple (and simple theories may not be either), Regularity lemmas for stable graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, Measurable sets with excluded distances, A weighted regularity lemma with applications, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Maximum dispersion problem in dense graphs, 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, Supersaturation problem for the bowtie, A median-type condition for graph tiling, Minimum rainbow \(H\)-decompositions of graphs, Testing subgraphs in directed graphs, Regularity properties for triple systems, On the relation of separability, bandwidth and embedding, Minimal Ramsey graphs on deleting stars for generalized fans and books, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Spanning triangulations in graphs, Asymptotic Structure for the Clique Density Theorem, On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós, Multipartite Ramsey numbers for odd cycles, Vertex Ramsey properties of randomly perturbed graphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, On edge‐ordered Ramsey numbers, Matchings with few colors in colored complete graphs and hypergraphs, A hypergraph blow-up lemma, Spanning Trees with Few Branch Vertices, Sprinkling a Few Random Edges Doubles the Power, A Degree Sequence Komlós Theorem, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Estimating parameters associated with monotone properties, Ramsey properties of randomly perturbed graphs: cliques and cycles, A discrepancy version of the Hajnal–Szemerédi theorem, Dense flag triangulations of 3-manifolds via extremal graph theory, Stable group theory and approximate subgroups, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Embedding Graphs Having Ore-Degree at Most Five, Quantitative structure of stable sets in arbitrary finite groups, Large planar subgraphs in dense graphs, Ramsey Numbers Involving Large Books, Large Book-Cycle Ramsey Numbers, Maker-Breaker Games on Randomly Perturbed Graphs, Extremal connectivity for topological cliques in bipartite graphs, Ramsey numbers for bipartite graphs with small bandwidth, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, Extremal functions for sparse minors, The regularity method for graphs with few 4‐cycles, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, Clique-factors in graphs with sublinear -independence number, On sufficient conditions for spanning structures in dense graphs, New upper bounds for Ramsey numbers of books, Ramsey numbers of large books, Ramsey upper density of infinite graph factors, Continuous stable regularity, On a rainbow extremal problem for color‐critical graphs, Ramsey numbers of large even cycles and fans, Turán‐type problems for long cycles in random and pseudo‐random graphs, Exact solutions to the Erdős-Rothschild problem, A Ramsey–Turán theory for tilings in graphs, Some Cubic Time Regularity Algorithms for Triple Systems, On the restricted size Ramsey number for a pair of cycles, Edge-colorings avoiding patterns in a triangle, Ramsey-Turán problems with small independence numbers, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, Ramsey number of paths and connected matchings in Ore-type host graphs, Ramsey numbers of fans and large books, Proof of an entropy conjecture of Leighton and Moitra, Lower bounds for the smallest singular value of structured random matrices, Large generalized books are \(p\)-good, Tilings in vertex ordered graphs, On the complexity of finite subgraphs of the curve graph, Remarks on an edge-coloring problem, Ramsey numbers of a fixed odd-cycle and generalized books and fans, Strong edge colorings of uniform graphs, Edge-colorings avoiding a fixed matching with a prescribed color pattern, Small complete minors above the extremal edge density, Multicolor Turán numbers, On a colored Turán problem of Diwan and Mubayi, Partitioning complete bipartite graphs by monochromatic cycles, On the diameter of separated point sets with many nearly equal distances, The minimum degree threshold for perfect graph packings, A variant of the hypergraph removal lemma, Distributing pairs of vertices on Hamiltonian cycles, Small subsets inherit sparse \(\varepsilon\)-regularity, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, An improved bound for the monochromatic cycle partition number, Monochromatic cycle partitions of graphs with large minimum degree, Powers of Hamilton cycles of high discrepancy are unavoidable, Integer and fractional packings of hypergraphs, An Ore-type theorem on Hamiltonian square cycles, Vertex covering with monochromatic pieces of few colours, On the density of a graph and its blowup, Turán-type results for partial orders and intersection graphs of convex sets, The Ramsey number for a triple of long even cycles, A Tverberg-type result on multicolored simplices, Avoider-Enforcer games played on edge disjoint hypergraphs, Bounds for graph regularity and removal lemmas, Maximum planar subgraphs in dense graphs, Turán numbers of bipartite graphs plus an odd cycle, The number of 3-SAT functions, Hamiltonian cycles with all small even chords, Loebl-Komlós-Sós conjecture: dense case, Rainbow connections of graphs: a survey, Approximate multipartite version of the Hajnal-Szemerédi theorem, The extremal function for partial bipartite tilings, The structure of almost all graphs in a hereditary property, Sparse partition universal graphs for graphs of bounded degree, Edge distribution and density in the characteristic sequence, A new proof of the graph removal lemma, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Induced saturation number, Combinatorial and computational aspects of graph packing and graph decomposition, Edges not in any monochromatic copy of a fixed graph, On a tiling conjecture of Komlós for 3-chromatic graphs., Hamilton cycles in dense vertex-transitive graphs, An extension of Turán's theorem, uniqueness and stability, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, On the chromatic number of \(H\)-free graphs of large minimum degree, The maximum edit distance from hereditary graph properties, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Deterministic vs non-deterministic graph property testing, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\), On embedding well-separable graphs, Note on the 3-graph counting Lemma, Long paths with endpoints in given vertex-subsets of graphs, Extremal problems and results related to Gallai-colorings, Monochromatic bounded degree subgraph partitions, Supersaturation problem for color-critical graphs, On 2-factors with \(k\) components, The critical window for the classical Ramsey-Turán problem, Non-Hermitian random matrices with a variance profile. I: Deterministic equivalents and limiting esds, Bipartite Ramsey numbers for graphs of small bandwidth, Proof of the bandwidth conjecture of Bollobás and Komlós, \(K_r\)-factors in graphs with low independence number, A removal lemma for systems of linear equations over finite fields, Cycles of given length in oriented graphs, Measuring instance difficulty for combinatorial optimization problems, 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, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Star-critical Ramsey numbers for large generalized fans and books, 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, Monochromatic square-cycle and square-path partitions, Small rainbow cliques in randomly perturbed dense graphs, Bandwidth theorem for random graphs, Vertex partitions by connected monochromatic \(k\)-regular graphs, Bounding the strong chromatic index of dense random graphs, Locating any two vertices on Hamiltonian cycles in large graphs, On the cover Ramsey number of Berge hypergraphs, Threshold Ramsey multiplicity for paths and even cycles, Cycle factors in dense graphs, Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, Highly connected coloured subgraphs via the regularity Lemma, Almost-spanning subgraphs with bounded degree in dense graphs, Star-critical Ramsey numbers involving large books, A degree sequence Hajnal-Szemerédi theorem