The typical structure of graphs with no large cliques
From MaRDI portal
Publication:681594
DOI10.1007/S00493-015-3290-9zbMath1399.05119arXiv1406.6961OpenAlexW2119646619MaRDI QIDQ681594
József Balogh, Hong Liu, Robert Morris, Maryam Sharifzadeh, Neal Bushaw, Maurício Collares
Publication date: 12 February 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.6961
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (8)
Two problems in graph Ramsey theory ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ Refinement on Spectral Turán’s Theorem ⋮ On stability of the Erdős-Rademacher problem ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ An efficient container lemma
Cites Work
- Unnamed Item
- Hypergraph containers
- The structure of almost all graphs in a hereditary property
- The number of graphs with large forbidden subgraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The asymptotic number of graphs not containing a fixed color-critical subgraph
- The number of graphs without forbidden subgraphs
- For which densities are random triangle-free graphs almost surely bipartite?
- On extremal problems of graphs and generalized graphs
- Excluding induced subgraphs: Critical graphs
- The typical structure of graphs without given excluded subgraphs
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- Projections of Bodies and Hereditary Properties of Hypergraphs
- On the Number of Graphs Without Large Cliques
- Independent sets in hypergraphs
This page was built for publication: The typical structure of graphs with no large cliques
