Tight bounds for divisible subdivisions

DOI10.1016/j.jctb.2023.10.011zbMath1530.05177arXiv2111.05723OpenAlexW3211901379MaRDI QIDQ6187340

Nemanja Draganić, Shagnik Das, Raphael Steiner

Publication date: 15 January 2024

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

Full work available at URL: https://arxiv.org/abs/2111.05723

zbMATH Keywords

branch verticessubdivision pathssubdivision vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph minors (05C83) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense minors in graphs of large girth
• Girth in graphs
• Some remarks on the odd Hadwiger's conjecture
• Note on coloring graphs without odd-\(K_k\)-minors
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Stability critical graphs and even subdivisions of \(K_ 4\)
• A complete characterization of the zero-sum (mod 2) Ramsey numbers
• Binomial coefficients and zero-sum Ramsey numbers
• Zero-sum problems -- a survey
• Zero sum cycles in complete digraphs
• Subdivisions of digraphs in tournaments
• On the odd-minor variant of Hadwiger's conjecture
• Graph decomposition with applications to subdivisions and path systems modulo k
• On several variations of the turan and ramsey numbers
• ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS
• Cycles Modulo k
• Problems in Zero-Sum Combinatorics
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On three zero‐sum Ramsey‐type problems
• Zero-sum delta-systems and multiple copies of graphs
• Minors in graphs of large girth
• Topological cliques in graphs II
• Expanders – how to find them, and what to find in them
• Forcing a sparse minor
• The Graph Minor Algorithm with Parity Conditions
• Totally odd subdivisions and parity subdivisions: Structures and Coloring
• Some Theorems on Abstract Graphs
• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
• Disjoint isomorphic balanced clique subdivisions
• Divisible subdivisions
• The size‐Ramsey number of short subdivisions
• A solution to Erdős and Hajnal’s odd cycle problem

This page was built for publication: Tight bounds for divisible subdivisions