Number of Cliques in Graphs with a Forbidden Subdivision

DOI10.1137/140979988zbMath1323.05074arXiv1407.7707OpenAlexW3103129013MaRDI QIDQ3449861

Choongbum Lee, Sang-il Oum

Publication date: 30 October 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7707

zbMATH Keywords

minorsubdivisioncliquetopological minor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Subgraph densities in a surface ⋮ 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 ⋮ Rank-width: algorithmic and structural results ⋮ The maximum number of paths of length three in a planar graph ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Counting cliques in 1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of cliques in a graph embedded in a surface
• Rank-width and tree-width of \(H\)-minor-free graphs
• 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
• An improved linear edge bound for graph linkages
• Proper minor-closed families are small
• An extremal function for contractions of graphs
• Topological cliques in graphs II

This page was built for publication: Number of Cliques in Graphs with a Forbidden Subdivision