3 papers
math.CO2024
Extremal density for subdivisions with length or sparsity constraints
Jaehoon Kim, Hong Liu, Yantao Tang +3
Given a graph , a balanced subdivision of is obtained by replacing all edges of with internally disjoint paths of the same length. In this paper, we prove that for any g…
math.CO2023
On powers of Hamilton cycles in Ramsey-Turán Theory
Ming Chen, Jie Han, Yantao Tang +1
We prove that for with and , there exist and such that for every , every -vertex graph with $δ(G)\geq \left(1-\fr…
math.CO2022
Balanced subdivisions of cliques in graphs
Bingyu Luan, Yantao Tang, Guanghui Wang +1
Given a graph , a balanced subdivision of is a graph obtained from by subdividing every edge the same number of times. In 1984, Thomassen conjectured that for each integ…