Turán theorems and convexity invariants for directed graphs

DOI10.1016/j.disc.2007.08.062zbMath1152.05031OpenAlexW2171989995MaRDI QIDQ941398

Beth Novick, Robert E. Jamison

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.062

zbMATH Keywords

convexityextremal graphspartially ordered setsHelly numberclosure systemRadon numberTuran's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• A Helly theorem for convexity in graphs
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• A generalization of Turan's theorem to directed graphs
• A Tverberg-type generalization of the Helly number of a convexity space
• Partition numbers for trees and ordered sets
• Caratheodory- and Helly-numbers of convex-product-structures
• Der Satz von Radon in konvexen Produktstrukturen. II
• Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
• Convexity in cristallographical lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turán theorems and convexity invariants for directed graphs