On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
From MaRDI portal
Publication:5855529
DOI10.1137/18M1206126zbMath1459.05132arXiv1606.06810MaRDI QIDQ5855529
Publication date: 18 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.06810
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ On the number of cliques in graphs with a forbidden minor ⋮ Clique immersion in graph products ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Counting cliques in 1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum degree condition forcing complete graph immersion
- Hypergraph containers
- Lower bound of the Hadwiger number of graphs by their average degree
- On the maximum number of cliques in a graph
- On the number of graphs without 4-cycles
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- On the number of cliques in graphs with a forbidden minor
- Proper minor-closed families are small
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Immersing small complete graphs
- An extremal function for contractions of graphs
- Number of Cliques in Graphs with a Forbidden Subdivision
- Complete graph immersions and minimum degree
- Topological cliques in graphs II
- THE METHOD OF HYPERGRAPH CONTAINERS
- Independent sets in hypergraphs
- Testing first-order properties for subclasses of sparse graphs
- Stochastic Algorithms: Foundations and Applications
This page was built for publication: On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
