An extremal graph problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On a problem of K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
Cited in
(18)- On the combinatorial problems which I would most like to see solved
- The extremal graph problem of the icosahedron
- The flag upper bound theorem for 3- and 5-manifolds
- A linear hypergraph extension of Turán's theorem
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Extremal Graph Problems for Graphs with a Color-Critical Vertex
- Measures on monotone properties of graphs
- Extremal graphs for odd wheels
- On the Turán number of the hypercube
- The fine structure of octahedron-free graphs
- Extremal graphs for the odd prism
- A stability theorem for multi-partite graphs
- Spectral extremal problem for the odd prism
- Extremal number of graphs from geometric shapes
- Non-degenerate hypergraphs with exponentially many extremal constructions
- Extremal number of graphs from geometric shapes (extended abstract)
This page was built for publication: An extremal graph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5642586)
