Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
From MaRDI portal
Publication:705743
DOI10.1007/s00493-004-0017-8zbMath1056.05082MaRDI QIDQ705743
Publication date: 14 February 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0017-8
05C35: Extremal problems in graph theory
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs, A Class of Three‐Colorable Triangle‐Free Graphs, On graphs with no induced subdivision of \(K_4\), Implicit representations and factorial properties of graphs, Topological minors in bipartite graphs, Induced subdivisions and bounded expansion, Chromatic number of ISK4-free graphs, The chromatic number of graphs with no induced subdivision of \(K_4\), Complete acyclic colorings, In absence of long chordless cycles, large tree-width becomes a local phenomenon, Subdivisions of a large clique in \(C_6\)-free graphs, Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case, Clique cutsets beyond chordal graphs, Vertex elimination orderings for hereditary graph classes, Amalgams and χ-Boundedness, On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph, A Separator Theorem for String Graphs and its Applications, A Separator Theorem for String Graphs and Its Applications
