Some extremal results on hypergraph Turán problems
From MaRDI portal
Publication:2158853
DOI10.1007/s11425-020-1892-4zbMath1493.05160arXiv1905.01685OpenAlexW3211648285MaRDI QIDQ2158853
Gennian Ge, Zixiang Xu, Tao Zhang
Publication date: 26 July 2022
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01685
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- On the combinatorial problems which I would most like to see solved
- Norm-graphs: Variations and applications
- Rational exponents for hypergraph Turan problems
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- A hypergraph extension of the bipartite Turán problem
- Remarks on the box problem
- New bounds for a hypergraph bipartite Turán problem
- Generalized Turán problems for even cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- On extremal problems of graphs and generalized graphs
- Norm-graphs and bipartite Turán numbers
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- Random algebraic construction of extremal graphs
- A note on the maximum number of triangles in a C5‐free graph
- 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
- On coloring graphs to maximize the proportion of multicolored k-edges
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
