A polynomial resultant approach to algebraic constructions of extremal graphs
From MaRDI portal
(Redirected from Publication:6668587)
Recommendations
- Extremal graphs without exponentially small bicliques
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Some extremal results on hypergraph Turán problems
- Norm-graphs and bipartite Turán numbers
- Some sharp lower bounds for the bipartite Turán number of theta graphs
Cites work
- A polynomial approach to linear algebra
- Color isomorphic even cycles and a related Ramsey problem
- Constructions of bipartite graphs from finite geometries
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Extremal numbers of cycles revisited
- Graphs with few paths of prescribed length between any two vertices
- Graphs without theta subgraphs
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Minimal Regular Graphs of Girths Eight and Twelve
- More on the extremal number of subdivisions
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- Number of Points of Varieties in Finite Fields
- On a problem of K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
- On Minimal graphs of maximum even girth
- On the structure of linear graphs
- Random algebraic construction of extremal graphs
- 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 Magma algebra system. I: The user language
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Turán numbers of theta graphs
This page was built for publication: A polynomial resultant approach to algebraic constructions of extremal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668587)