Extremal problems for directed graphs

DOI10.1016/0095-8956(73)90034-8zbMath0253.05124WikidataQ105675818 ScholiaQ105675818MaRDI QIDQ2557710

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

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90034-8

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C20: Directed graphs (digraphs), tournaments

Related Items

Turán-Ramsey Theorems and K_p-Independence Numbers, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, On a class of degenerate extremal graph problems, On the jumping constant conjecture for multigraphs, Turán-Ramsey theorems and simple asymptotically extremal structures, Boundedness of optimal matrices in extremal multigraph and digraph problems, Co-degree density of hypergraphs, Turán problems for integer-weighted graphs, Algorithmic Solution of Extremal Digraph Problems, Inequalities in probability theory and turán-type problems for graphs with colored vertices, On paul turán's influence on graph theory

Cites Work

• 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