Crux, space constraints and subdivisions

DOI10.1016/J.JCTB.2024.08.005MaRDI QIDQ6652092zbMATH OpenFDO

Authors Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu

Publication date 12 December 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.08.005

zbMATH Keywords

clique subdivisionstopological structure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Balanced subdivisions of cliques in graphs
• Topological Cliques in Graphs
• Disjoint isomorphic balanced clique subdivisions

Cites work

• A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
• A solution to Erdős and Hajnal’s odd cycle problem
• An extremal problem for subdivisions ofK?5
• Clique immersion in graphs without a fixed bipartite graph
• Crux and Long Cycles in Graphs
• Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
• Extremal density for sparse minors and subdivisions
• Finding and using expanders in locally sparse graphs
• Finding large expanders in graphs: from topological minors to induced subgraphs
• Hadwiger's conjecture is true for almost every graph
• Hamiltonian degree sequences in digraphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• How to build a pillar: a proof of Thomassen's conjecture
• scientific article; zbMATH DE number 3769674 (Why is no real title available?)
• scientific article; zbMATH DE number 1870233 (Why is no real title available?)
• Improved Bounds for Topological Cliques in Graphs of Large Girth
• Large Topological Cliques in Graphs Without a 4-Cycle
• Minors in expanding graphs
• Nested cycles with no geometric crossings
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Ramsey numbers of cycles versus general graphs
• Reducibility among combinatorial problems
• Subdivisions of a large clique in \(C_6\)-free graphs
• Subexponential algorithms for unique games and related problems
• Sur le problème des courbes gauches en topologie.
• The probabilistic method
• Topological Cliques in Graphs
• Topological cliques in graphs II
• Topological cliques of random graphs
• Topological minors in graphs of large girth
• Well-mixing vertices and almost expanders

Cited in

(2)

• Extremal density for subdivisions with length or sparsity constraints
• Embedding clique subdivisions via crux

This page was built for publication: Crux, space constraints and subdivisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652092)