Separating systems and oriented graphs of diameter two

DOI10.1016/j.jctb.2006.04.007zbMath1109.05103OpenAlexW2074965234MaRDI QIDQ864898

Béla Bollobás, Alexander D. Scott

Publication date: 13 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.04.007

Mathematics Subject Classification ID

Extremal set theory (05D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Rainbow Saturation and Graph Capacities ⋮ On the biclique cover of the complete graph ⋮ The complexity of two graph orientation problems ⋮ Separating path systems for the complete graph ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Search When the Lie Depends on the Target ⋮ Some new bounds for cover-free families through biclique covers

Cites Work

• On separating systems whose elements are sets of at most k elements
• On separating systems
• Perfect Hashing and Probability
• On generalized graphs
• On separating systems of a finite set
• Minimal completely separating systems
• On a problem concerning separating systems of a finite set
• Minimal completely separating systems of \(k\)-sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separating systems and oriented graphs of diameter two