✳flâneur — a map of the web's best reading

[2004.10180] The regularity method for graphs with few 4-cycles

arxiv.org · 563 words · saved by 1 readers

YOU make open access possible! Tell us why you support #openaccess and give to arXiv this week to help keep science open for all. Help | Advanced Search arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status

[2004.10180] The regularity method for graphs with few 4-cycles --> Mathematics > Combinatorics arXiv:2004.10180 (math) [Submitted on 21 Apr 2020 ( v1 ), last revised 25 Sep 2021 (this version, v3)] Title: The regularity method for graphs with few 4-cycles Authors: David Conlon , Jacob Fox , Benny Sudakov , Yufei Zhao View a PDF of the paper titled The regularity method for graphs with few 4-cycles, by David Conlon and 3 other authors View PDF Abstract: We develop a sparse graph regularity method that applies to graphs with few 4-cycles, including new counting and removal lemmas for 5-cycles i

Explore this link on the map →

saved by

related reading