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 (only showing first 100 items - show all)

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 ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Ramsey number of paths and connected matchings in Ore-type host graphs

This page was built for publication: