A note on dense bipartite induced subgraphs

Stefan Glock

A note on dense bipartite induced subgraphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.05101 v1 pith:KP7ZJEUW submitted 2020-06-09 math.CO

Stefan Glock This is my paper · ORCID

classification math.CO

keywords bipartitecontainsdegreeinducedaveragedenseeveryexposition

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

This exposition contains a short and streamlined proof of the recent result of Kwan, Letzter, Sudakov and Tran that every triangle-free graph with minimum degree $d$ contains an induced bipartite subgraph with average degree $\Omega(\ln d/\ln\ln d)$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

$C_4$-free subgraphs of high degree with geometric applications
math.CO 2025-06 conditional novelty 8.0 of 10

A new dichotomy about C4-free induced subgraphs and dense patches yields optimal O(sn) bounds for geometric Zarankiewicz problems and a near-tight semilinear bound.

Pith tools