5 papers
Balanced clique subdivisions and cycles lengths in -free graphs
Jianfeng Hou, Yindong Jin, Donglei Yang +1
Let be integers. Confirming a conjecture of Mader, Liu and Montgomery [J. Lond. Math. Soc., 2017] showed that every -free graph with average degree cont…
Large cliques in graphs with forbidden semi-induced structures
Nannan Chen, Yulai Ma, Fan Yang
In 2022, Holmsen showed that any graph with at least \( c \binom{n}{r} \) \(r\)-cliques but no induced complete -partite graph must contain a clique of order \…
A Hypergraph Approach to Distributed Broadcast
Qi Cao, Yulin Shao, Fan Yang +1
This paper explores the distributed broadcast problem within the context of network communications, a critical challenge in decentralized information dissemination. We put forth a…
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…
Topological cliques in sparse expanders
Xia Wang, Donglei Yang, Fan Yang +1
In the paper, we focus on embedding clique immersions and subdivisions within sparse expanders, and we derive the following main results: (1) For any , there exists $K>…