Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
From MaRDI portal
Publication:1277309
DOI10.1006/eujc.1997.0188zbMath0918.05095OpenAlexW2084389562WikidataQ123133412 ScholiaQ123133412MaRDI QIDQ1277309
Andrew G. Thomason, Béla Bollobás
Publication date: 10 August 1999
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bb2809ab86c11f384ecf86935df5cb967a8c6e29
Related Items (52)
On 1-subdivisions of transitive tournaments ⋮ Dynamic coloring of graphs having no \(K_5\) minor ⋮ Number of Cliques in Graphs with a Forbidden Subdivision ⋮ Immersion of transitive tournaments in digraphs with large minimum outdegree ⋮ Crux and Long Cycles in Graphs ⋮ Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs ⋮ Coloring immersion-free graphs ⋮ New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ Some recent progress and applications in graph minor theory ⋮ Clustered variants of Hajós' conjecture ⋮ A minimum degree condition forcing complete graph immersion ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Induced subdivisions and bounded expansion ⋮ Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$ ⋮ Rainbow clique subdivisions ⋮ Topological minors in graphs of large girth ⋮ Some mader-perfect graph classes ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Tight bounds for divisible subdivisions ⋮ Rainbow subdivisions of cliques ⋮ On nowhere dense graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Topological minors in bipartite graphs ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Boxicity, poset dimension, and excluded minors ⋮ Compact topological minors in graphs ⋮ On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮ On colorability of graphs with forbidden minors along paths and circuits ⋮ Logarithmically small minors and topological minors ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Lift-contractions ⋮ Dependent random choice ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density ⋮ Improper colouring of graphs with no odd clique minor ⋮ Approximating the maximum clique minor and some subgraph homeomorphism problems ⋮ A Structure Theorem for Strong Immersions ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Dichromatic number and forced subdivisions ⋮ Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor ⋮ Linear time algorithms for finding a dominating set of fixed size in degenerated graphs ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Subdivisions of transitive tournaments ⋮ High-girth graphs avoiding a minor are nearly bipartite ⋮ Unnamed Item ⋮ Extremal connectivity for topological cliques in bipartite graphs ⋮ Subdivisions of a large clique in \(C_6\)-free graphs ⋮ STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp) ⋮ Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
This page was built for publication: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
