Induced subdivisions and bounded expansion
From MaRDI portal
Publication:1686256
DOI10.1016/j.ejc.2017.10.004zbMath1376.05093arXiv1706.05766OpenAlexW2648245838MaRDI QIDQ1686256
Publication date: 21 December 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.05766
Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items (4)
Regular partitions of gentle graphs ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Dense Induced Subgraphs of Dense Bipartite Graphs ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes
Cites Work
- Sparsity. Graphs, structures, and algorithms
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Grad and classes with bounded expansion. I: Decompositions
- Deciding First-Order Properties of Nowhere Dense Graphs
- Topological cliques in graphs II
This page was built for publication: Induced subdivisions and bounded expansion
