Embedding clique subdivisions via crux

Abstract For a graph with average degree and a constant , we denote by the minimum order of a subgraph with . Liu and Montgomery conjectured that every graph contains as a subdivision for . In the paper, we prove this conjecture.

Authors

Institutions

Publication Details

Journal
Journal of the London Mathematical Society
Published
2025-02-01
DOI
https://doi.org/10.1112/jlms.70073
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Embedding clique subdivisions via crux

Fan Yang, Donglei Yang
Journal of the London Mathematical Society
Finite Group Theory Research
article

Embedding clique subdivisions via crux

Fan Yang, Donglei Yang
article en

Abstract

Abstract For a graph with average degree and a constant , we denote by the minimum order of a subgraph with . Liu and Montgomery conjectured that every graph contains as a subdivision for . In the paper, we prove this conjecture.

Journal of the London Mathematical SocietyVol. 111(2)
Shandong University (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation, Natural Science Foundation of Shandong Province
Openalex Percentile: Top 95%
Finite Group Theory Research
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Embedding clique subdivisions via crux — Fan Yang, Donglei Yang · Journal of the London Mathematical Society (2025) | TGRS Research Map | TGRS