A generalization of Turan's theorem to directed graphs

DOI10.1016/0012-365X(80)90052-7zbMath0442.05029OpenAlexW2100273540MaRDI QIDQ1143405

Stephen B. Maurer, Issie Rabinovich, William T. jun. Trotter

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90052-7

zbMATH Keywords

extremal graphsdirected graphtransitive tournamentunipathic graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Large minimal realizers of a partial order. II ⋮ Turán theorems and convexity invariants for directed graphs ⋮ 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\)

Cites Work

• Unnamed Item
• The rank of a distributive lattice
• Large minimal realizers of a partial order. II
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Large Minimal Realizers of a Partial Order

This page was built for publication: A generalization of Turan's theorem to directed graphs