Regular Turán numbers of complete bipartite graphs
From MaRDI portal
Publication:2043399
DOI10.1016/j.disc.2021.112531zbMath1469.05080arXiv2005.02907MaRDI QIDQ2043399
Publication date: 2 August 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02907
05C35: Extremal problems in graph theory
05C30: Enumeration in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
11N05: Distribution of primes
Related Items
Unnamed Item, Powers of 2 in two Goldbach-Linnik type problems involving prime cubes, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, Saturation problems with regularity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- On the spectrum of Wenger graphs
- Regular subgraphs of almost regular graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Large sets in finite fields are sumsets
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- On the spectrum of projective norm-graphs
- Theorems in the additive theory of numbers
- A new result on the problem of Zarankiewicz
- Graphs from projective planes
- Explicit Ramsey graphs and orthonormal labelings
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- New asymptotics for bipartite Turán numbers
- A construction for clique-free pseudorandom graphs
- Dynamic cage survey
- The eigenvalues of the graphs \(D(4,q)\)
- Sharp bounds for some multicolour Ramsey numbers
- Norm-graphs and bipartite Turán numbers
- The Difference Between Consecutive Primes, II
- Diameters and Eigenvalues
- Solving a linear equation in a set of integers I
- Singular Ramsey and Turán numbers
- The Zarankiewicz problem in 3‐partite graphs
- Graphentheoretische Extremalprobleme
- On Graphs that do not Contain a Thomsen Graph
- On sums of powers of almost equal primes
- On sums of powers of almost equal primes
