scientific article; zbMATH DE number 3908459

MaRDI QIDQ3686736zbMATH OpenFDO

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

Publication date 1984

zbMATH Keywords

extremal digraphsTurán problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Boundedness of optimal matrices in extremal multigraph and digraph problems
• Digraphs with maximum number of paths and cycles
• Algorithmic Solution of Extremal Digraph Problems
• Extremal problems for directed graphs
• scientific article; zbMATH DE number 1943959

Cited in

(13)

• The inverse Voronoi problem in graphs. I: Hardness
• Extremal digraphs avoiding an orientation of the diamond
• Dumbbell graphs with extremal (reverse) cover cost
• Extremal digraphs avoiding an orientation of \(C_4\)
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• Extremal problems for directed graphs
• On an extremal inverse problem in graph theory
• Algorithmic Solution of Extremal Digraph Problems
• On possible Turán densities
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• Extremal digraphs containing at most t paths of length 2 with the same endpoints
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686736)