Extremal problems for directed graphs
From MaRDI portal
Publication:2557710
DOI10.1016/0095-8956(73)90034-8zbMath0253.05124OpenAlexW2061854402WikidataQ105675818 ScholiaQ105675818MaRDI QIDQ2557710
Paul Erdős, Miklós Simmonovits, William G. Brown
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
Related Items
Turán number of 3-free strong digraphs with out-degree restriction, Turán-Ramsey theorems and simple asymptotically extremal structures, Boundedness of optimal matrices in extremal multigraph and digraph problems, 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, Extremal digraphs avoiding distinct walks of length 4 with the same endpoints, Co-degree density of hypergraphs, Turán-Ramsey Theorems and Kp-Independence Numbers, On Turán numbers for disconnected hypergraphs, The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, The Turán number of directed paths and oriented cycles, The structure of hereditary properties and 2-coloured multigraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Extremal numbers for directed hypergraphs with two edges, A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints, Algorithmic Solution of Extremal Digraph Problems, Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints, On paul turán's influence on graph theory, Extremal digraphs avoiding an orientation of the diamond, Extremal digraphs avoiding an orientation of \(C_4\), On a class of degenerate extremal graph problems, Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints, Turán problems for integer-weighted graphs
Cites Work
