A note concerning paths and independence number in digraphs

DOI10.1016/0012-365X(90)90210-9zbMath0701.05020OpenAlexW2013194273MaRDI QIDQ913811

Bill Jackson, Geňa Hahn

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90210-9

zbMATH Keywords

independence numberdigraphspath covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Digraphs Products

Cites Work

• Unnamed Item
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• Graph Theory and Probability. II

This page was built for publication: A note concerning paths and independence number in digraphs