2000 character limit reached
Regular Turán numbers and some Gan-Loh-Sudakov-type problems
Published 19 Nov 2019 in math.CO | (1911.08452v2)
Abstract: Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Tur\'an numbers, a natural variation on the classical Tur\'an numbers for which the host graph is required to be regular. Among other results, we prove a striking supersaturation version of Mantel's theorem in the case of a regular host graph of odd order. We also characterise the graphs for which the regular Tur\'an numbers behave classically or otherwise.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.