Work

Regular Turán numbers

Year: 2019

Type: article

Abstract: The regular Turán number of a graph $F$, denoted by rex$(n,F)$, is the largest number of edges in a regular graph $G$ of order $n$ such that $G$ does not contain subgraphs isomorphic to $F$. Giving a partial answer to a recent problem raised by Gerbner et al. [arXiv:1909.04980] we prove that rex$(n,F)$ asymptotically equals the (classical) Turán number whenever the chromatic number of $F$ is at least four; but it is substantially different for some 3-chromatic graphs $F$ if $n$ is odd.

Source: Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)

DOI: 10.48550/arxiv.1911.00109

Authors: Caro, Yair, Tuza, Zsolt

Institution: HUN-REN Alfréd Rényi Institute of Mathematics

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, National Research, Development and Innovation Office

Awards: G2287797518, G4745933073, G7946896065