Algorithmic Solution of Extremal Digraph Problems

DOI10.2307/2000222zbMATH Open0607.05040OpenAlexW4243523107MaRDI QIDQ3745867FDOQ3745867

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

Publication date: 1985

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

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

zbMATH Keywords

digraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Title not available (Why is that?)
• On the theory of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On pancyclic digraphs
• Extremal problems for directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Title not available (Why is that?)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Turán-Ramsey theorems and simple asymptotically extremal structures
• Turán number of 3-free strong digraphs with out-degree restriction
• 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 K_p-Independence Numbers
• Title not available (Why is that?)
• 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
• Turán problems for oriented graphs
• 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
• 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)