A polynomial resultant approach to algebraic constructions of extremal graphs
From MaRDI portal
Publication:6668587
DOI10.1007/s11425-022-2248-9MaRDI QIDQ6668587
Publication date: 22 January 2025
Published in: Science China. Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Norm-graphs: Variations and applications
- The Magma algebra system. I: The user language
- Graphs without theta subgraphs
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- More on the extremal number of subdivisions
- A polynomial approach to linear algebra
- Norm-graphs and bipartite Turán numbers
- Random algebraic construction of extremal graphs
- Constructions of bipartite graphs from finite geometries
- Extremal Numbers of Cycles Revisited
- Turán numbers of theta graphs
- Graphs with few paths of prescribed length between any two vertices
- Color Isomorphic Even Cycles and a Related Ramsey Problem
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Number of Points of Varieties in Finite Fields
- On the structure of linear graphs
This page was built for publication: A polynomial resultant approach to algebraic constructions of extremal graphs
