Algorithmic Solution of Extremal Digraph Problems
From MaRDI portal
Publication:3745867
Recommendations
Cites work
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 3908459 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (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?)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Extremal problems for directed graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On pancyclic digraphs
- On the theory of graphs
Cited in
(20)- scientific article; zbMATH DE number 7564191 (Why is no real title available?)
- Turán number of 3-free strong digraphs with out-degree restriction
- Turán-Ramsey theorems and simple asymptotically extremal structures
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The structure of hereditary properties and 2-coloured multigraphs
- Extremal problems for directed graphs
- On possible Turán densities
- Extremal digraphs avoiding an orientation of \(C_4\)
- Turán-Ramsey Theorems and Kp-Independence Numbers
- scientific article; zbMATH DE number 3908459 (Why is no real title available?)
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- Co-degree density of hypergraphs
- On the jumping constant conjecture for multigraphs
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Inequalities in probability theory and turán-type problems for graphs with colored vertices
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Turán problems for oriented graphs
- Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
- Turán problems for mixed graphs
- Turán problems for integer-weighted graphs
This page was built for publication: Algorithmic Solution of Extremal Digraph Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745867)