Algorithmic Solution of Extremal Digraph Problems

DOI10.2307/2000222zbMath0607.05040OpenAlexW4243523107MaRDI QIDQ3745867

Paul Erdős, William G. Brown, Miklós Simmonovits

Publication date: 1985

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

zbMATH Keywords

digraphs

Mathematics Subject Classification ID

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

Related Items

Turán number of 3-free strong digraphs with out-degree restriction, Turán-Ramsey theorems and simple asymptotically extremal structures, Inequalities in probability theory and turán-type problems for graphs with colored vertices, On the jumping constant conjecture for multigraphs, Extremal digraphs avoiding distinct walks of length 3 with the same endpoints, Co-degree density of hypergraphs, Turán-Ramsey Theorems and K_p-Independence Numbers, On possible Turán densities, The structure of hereditary properties and 2-coloured multigraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, 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, Extremal digraphs avoiding an orientation of \(C_4\), Turán problems for integer-weighted graphs

Cites Work

• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• On pancyclic digraphs
• Extremal problems for directed graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item