Extremal graphs without exponentially small bicliques
From MaRDI portal
Publication:6610106
DOI10.1215/00127094-2023-0043zbMATH Open1547.05134MaRDI QIDQ6610106
Publication date: 24 September 2024
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Secant varieties, tensor rank, varieties of sums of powers (14N07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- The de Bruijn-Erdős theorem for hypergraphs
- Norm-graphs: Variations and applications
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- The polynomial method over varieties
- Norm-graphs and bipartite Turán numbers
- An upper bound on the number of rational points of arbitrary projective varieties over finite fields
- Random algebraic construction of extremal graphs
- An Upper Bound on Zarankiewicz' Problem
- Turán numbers of theta graphs
- Some remarks on the Zarankiewicz problem
- Graphs with few paths of prescribed length between any two vertices
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Representations of multivariate polynomials by sums of univariate polynomials in linear forms
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
This page was built for publication: Extremal graphs without exponentially small bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610106)
