On the number of cliques in graphs with a forbidden minor
From MaRDI portal
Publication:2399355
DOI10.1016/j.jctb.2017.04.004zbMath1368.05110arXiv1603.07056OpenAlexW2963779710MaRDI QIDQ2399355
Publication date: 22 August 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07056
Enumeration in graph theory (05C30) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ The maximum number of paths of length three in a planar graph ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Phase transition of degeneracy in minor-closed families ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Counting cliques in 1-planar graphs
Cites Work
- Cliques in graphs excluding a complete graph minor
- Graph minors. XX: Wagner's conjecture
- Rank-width and tree-width of \(H\)-minor-free graphs
- 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
- The extremal function for complete minors
- Proper minor-closed families are small
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- An extremal function for contractions of graphs
- Number of Cliques in Graphs with a Forbidden Subdivision
- Testing first-order properties for subclasses of sparse graphs
- Some Theorems on Abstract Graphs
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of cliques in graphs with a forbidden minor
