Small topological complete subgraphs of ``dense graphs
From MaRDI portal
DOI10.1007/BF02122555zbMATH Open0643.05039MaRDI QIDQ1101464FDOQ1101464
Authors: Alexandr Kostochka, Laszló Pyber
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (20)
- Title not available (Why is that?)
- The extremal number of the subdivisions of the complete bipartite graph
- Rainbow clique subdivisions
- Turán numbers of bipartite subdivisions
- Unavoidable configurations in complete topological graphs
- More on the extremal number of subdivisions
- Title not available (Why is that?)
- Multitasking capacity: hardness results and improved constructions
- Small complete minors above the extremal edge density
- Small minors in dense graphs
- Logarithmically small minors and topological minors
- Title not available (Why is that?)
- Rainbow Turán number of clique subdivisions
- Sublinear separators, fragility and subexponential expansion
- On the extremal number of subdivisions
- The Size of a Graph Without Topological Complete Subgraphs
- Space crossing numbers
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle
- The extremal number of longer subdivisions
- Compact topological minors in graphs
This page was built for publication: Small topological complete subgraphs of ``dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101464)