Extremal graphs without exponentially small bicliques
From MaRDI portal
(Redirected from Publication:6610106)
Recommendations
Cites work
- An upper bound on the number of rational points of arbitrary projective varieties over finite fields
- An Upper Bound on Zarankiewicz' Problem
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
- Graphs with few paths of prescribed length between any two vertices
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 3505014 (Why is no real title available?)
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 1027930 (Why is no real title available?)
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Random algebraic construction of extremal graphs
- Rational exponents in extremal graph theory
- Representations of multivariate polynomials by sums of univariate polynomials in linear forms
- Some extremal results on complete degenerate hypergraphs
- Some remarks on the Zarankiewicz problem
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- The de Bruijn-Erdős theorem for hypergraphs
- The history of degenerate (bipartite) extremal graph problems
- The polynomial method over varieties
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Turán numbers of theta graphs
Cited in
(13)- Finite Geometry and Extremal Graph Theory
- Induced Turán problem in bipartite graphs
- A polynomial resultant approach to algebraic constructions of extremal graphs
- On the boundedness of degenerate hypergraphs
- A generalisation of Varnavides's theorem
- Applications of random algebraic constructions to hardness of approximation
- Extremal number of graphs from geometric shapes
- Phase transition of degenerate Turán problems in p-norms
- A new approach for the Brown-Erdős-Sós problem
- Turán number of complete bipartite graphs with bounded matching number
- Kővári-Sós-Turán theorem for hereditary families
- Maximum in-general-position set in a random subset of \(\mathbb{F}_q^d\)
- Subgraphs of the projective norm graph
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)
