Algorithmic Solution of Extremal Digraph Problems

DOI10.2307/2000222MaRDI QIDQ3745867zbMATH OpenOpenAlexFDO

Authors William G. Brown, Miklós Simonovits, P. Erdős

Publication date 1985

Full work available at URL https://doi.org/10.2307/2000222

zbMATH Keywords

digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• Extremal problems for directed graphs
• scientific article; zbMATH DE number 3908459
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• scientific article; zbMATH DE number 4066942
• Digraphs with maximum number of paths and cycles

Cites work

• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Extremal problems for directed graphs
• 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?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On pancyclic digraphs
• On the theory of graphs

Cited in

(23)

• On the jumping constant conjecture for multigraphs
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
• Turán number of 3-free strong digraphs with out-degree restriction
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• Extremal digraphs avoiding an orientation of \(C_4\)
• Turán-Ramsey theorems and simple asymptotically extremal structures
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• Extremal problems for directed graphs
• Co-degree density of hypergraphs
• Turán problems for integer-weighted graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• scientific article; zbMATH DE number 3908459 (Why is no real title available?)
• Inequalities in probability theory and turán-type problems for graphs with colored vertices
• Turán-Ramsey Theorems and K_p-Independence Numbers
• On possible Turán densities
• scientific article; zbMATH DE number 7564191 (Why is no real title available?)
• Turán problems for mixed graphs
• The structure of hereditary properties and 2-coloured multigraphs
• Turán problems for oriented graphs
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• Turán number of strong digraphs forbidden at least two triangles
• Extremal digraphs containing at most t paths of length 2 with the same endpoints

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)