Extremal graphs without exponentially-small bicliques
math.CO, math.AG
Submitted: 2021-07-09
Updated: 2023-08-06
Terminology
Sources
- The de Bruijn-Erdos Theorem for Hypergraphs
- Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Random algebraic construction of extremal graphs
- Rational exponents in extremal graph theory
- Tur'an numbers of theta graphs
- Some remarks on the Zarankiewicz problem
- An upper bound on the number of rational points of arbitrary projective varieties over finite fields
- The history of degenerate (bipartite) extremal graph problems
- The polynomial method over varieties
- Some tight lower bounds for Tur'{a}n problems via constructions of multi-hypergraphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality