Regular Turan numbers of complete bipartite graphs

被引：4

作者：

Tait, Michael ^{[1
]}

Timmons, Craig ^{[2
]}

机构：

[1] Villanova Univ, Dept Math & Stat, Villanova, PA 19085 USA

[2] Calif State Univ Sacramento, Dept Math & Stat, Sacramento, CA 95819 USA

来源：

DISCRETE MATHEMATICS | 2021年 / 344卷 / 10期

基金：

美国国家科学基金会;

关键词：

Turan number; Regular Turan number; Algebraically defined graphs; Eigenvalues; ZARANKIEWICZ; SPECTRUM;

D O I：

10.1016/j.disc.2021.112531

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let rex(n, F) denote the maximum number of edges in an n-vertex graph that is regular and does not contain F as a subgraph. We give lower bounds on rex(n, F), that are best possible up to a constant factor, when F is one of C-4, K-2,K-t, K-3,K-3 or K-s,K-t for t > s!. (C) 2021 Elsevier B.V. All rights reserved.

引用

页数：13

共 36 条

[1] Sharp bounds for some multicolor Ramsey numbers
Alon, N
Rödl, V
[J]. COMBINATORICA, 2005, 25 (02) : 125 - 141
[2] REGULAR SUBGRAPHS OF ALMOST REGULAR GRAPHS
ALON, N
FRIEDLAND, S
KALAI, G
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (01) : 79 - 91
[3] Alon N., 1994, ELECTRON J COMB, V1, pR12
[4] Large sets in finite fields are sumsets
Alon, Noga
[J]. JOURNAL OF NUMBER THEORY, 2007, 126 (01) : 110 - 118
[5] Andrasfai B., 1964, Acta Math. Acad. Sci. Hungar, V15, P413, DOI DOI 10.1007/BF01897150
[6] The difference between consecutive primes, II
Baker, RC
Harman, G
Pintz, J
[J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2001, 83 : 532 - 562
[7] A Construction for Clique-Free Pseudorandom Graphs
Bishnoi, Anurag
Ihringer, Ferdinand
Pepe, Valentina
[J]. COMBINATORICA, 2020, 40 (03) : 307 - 314
[8] Bose Raj C, 1962, Comment. Math. Helv, V37, P141, DOI DOI 10.1007/BF02566968
[9] ON GRAPHS THAT DO NOT CONTAIN A THOMSEN GRAPH
BROWN, WG
[J]. CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (03): : 281 - &
[10] Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian
Butler, Steve
Chung, Fan
[J]. ANNALS OF COMBINATORICS, 2010, 13 (04) : 403 - 412

← 1 2 3 4 →