The locally dense induced-subgraph conjecture for -free graphs
The locally dense induced-subgraph conjecture for -free graphs
From papers
Let be a finite simple graph. For an induced subgraph of and , let be the neighbours of in . local-density conjecture. There exists such that every -free graph has an induced subgraph satisfying
and
for every . This is presented as a weaker, particularly interesting special case of the colourful induced-subgraph conjecture; the source does not report a resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Tung H. Nguyen, “On polynomially high-chromatic pure pairs”, arXiv:2504.21127 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.