Random algebraic construction of extremal graphs
From MaRDI portal
Abstract: In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
Cites work
- scientific article; zbMATH DE number 3563286 (Why is no real title available?)
- scientific article; zbMATH DE number 1027930 (Why is no real title available?)
- An Upper Bound on Zarankiewicz' Problem
- Definability and fast quantifier elimination in algebraically closed fields
- Equations over finite fields. An elementary approach
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- Number of Points of Varieties in Finite Fields
- On Graphs that do not Contain a Thomsen Graph
- On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
- On the structure of linear graphs
- Turan's Graph Theorem
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
Cited in
(32)- Graphs with few paths of prescribed length between any two vertices
- Color isomorphic even cycles and a related Ramsey problem
- On Turán exponents of bipartite graphs
- On color isomorphic subdivisions
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Turán numbers of bipartite subdivisions
- Random polynomial graphs for random Turán problems
- Turán numbers of theta graphs
- Ramsey properties of algebraic graphs and hypergraphs
- On the rational Turán exponents conjecture
- A hypergraph bipartite Turán problem with odd uniformity
- Some extremal results on hypergraph Turán problems
- Some sharp lower bounds for the bipartite Turán number of theta graphs
- A proof of the (n, k, t) conjectures
- Repeated patterns in proper colorings
- Generalized Turán problems for complete bipartite graphs
- Extremal graphs without exponentially small bicliques
- Evasive sets, covering by subspaces, and point-hyperplane incidences
- Random multilinear maps and the Erdős box problem
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Extremal number of graphs from geometric shapes
- A note on projective norm graphs
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Some extremal results on complete degenerate hypergraphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Applications of random algebraic constructions to hardness of approximation
- Interview with David Conlon
- A polynomial resultant approach to algebraic constructions of extremal graphs
- Many Turán exponents via subdivisions
- scientific article; zbMATH DE number 5989950 (Why is no real title available?)
- Some remarks on the Zarankiewicz problem
- On the Turán Number of Generalized Theta Graphs
This page was built for publication: Random algebraic construction of extremal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458419)
