Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3

DOI10.1093/IMRN/RNAC076zbMath1515.05093arXiv2109.06110OpenAlexW4226523359WikidataQ113819041 ScholiaQ113819041MaRDI QIDQ6101105

Oliver Janzer

Publication date: 31 May 2023

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.06110

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

On Ramsey Size-Linear Graphs and Related Questions

This page was built for publication: Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3