Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
From MaRDI portal
Publication:794664
Recommendations
Cites work
- scientific article; zbMATH DE number 3885945 (Why is no real title available?)
- scientific article; zbMATH DE number 3908459 (Why is no real title available?)
- scientific article; zbMATH DE number 3966110 (Why is no real title available?)
- scientific article; zbMATH DE number 3608064 (Why is no real title available?)
- scientific article; zbMATH DE number 3641461 (Why is no real title available?)
- scientific article; zbMATH DE number 1943959 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (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 3298603 (Why is no real title available?)
- scientific article; zbMATH DE number 3333210 (Why is no real title available?)
- Extremal problems for directed graphs
- Extremals of functions on graphs with applications to graphs and hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On some extremal problems on \(r\)-graphs
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the structure of linear graphs
- On the theory of graphs
Cited in
(25)- Generating non-jumps from a known one
- The inducibility of complete bipartite graphs
- 4-books of three pages
- Co-degree density of hypergraphs
- Existence and uniqueness of solutions to the norm minimum problem on digraphs
- Variations on the theme of repeated distances
- Coverings of r—graphs by complete r—partite subgraphs
- On the algebraic and topological structure of the set of Turán densities
- On possible Turán densities
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Algorithmic Solution of Extremal Digraph Problems
- The maximal length of a gap between \(r\)-graph Turán densities
- The density maximization problem in graphs
- On the jumping constant conjecture for multigraphs
- Popular distances in 3-space
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Extremal problems for directed graphs
- Non-jumping Turán densities of hypergraphs
- Coloring directed hypergraphs
- Inequalities in probability theory and turán-type problems for graphs with colored vertices
- Extremal numbers for directed hypergraphs with two edges
- An exact Turán result for tripartite 3-graphs
- Turán problems for integer-weighted graphs
- Asymptotic solution for a new class of forbidden r-graphs
This page was built for publication: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794664)