Topological cliques in graphs II

DOI10.1017/S096354830000184XzbMath0846.05023OpenAlexW2109542562MaRDI QIDQ4883063

Publication date: 1 July 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830000184x

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items

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, Coloring immersion-free graphs, New exact values of the maximum size of graphs free of topological complete subgraphs, Clique immersion in graphs without a fixed bipartite graph, 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, Proof of Komlós's conjecture on Hamiltonian subsets, Sublinear separators, fragility and subexponential expansion, 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, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, How to build a pillar: a proof of Thomassen's conjecture, Subdivisions with congruence constraints in digraphs of large chromatic number, Towards the Erdős-Gallai cycle decomposition conjecture, Tight bounds for divisible subdivisions, Rainbow subdivisions of cliques, On nowhere dense graphs, Finding and Using Expanders in Locally Sparse Graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Local Conditions for Exponentially Many Subdivisions, Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, Subdivisions of digraphs in tournaments, 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, An extremal problem for subdivisions ofK?5, 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, \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked, 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, Highly linked graphs, Minors in lifts of graphs, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, Subdivisions of transitive tournaments, Unnamed Item, Extremal connectivity for topological cliques in bipartite graphs, Subdivisions of a large clique in \(C_6\)-free graphs, Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision, Nested cycles with no geometric crossings

Cites Work