Separating systems and oriented graphs of diameter two
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 736306 (Why is no real title available?)
- scientific article; zbMATH DE number 874214 (Why is no real title available?)
- scientific article; zbMATH DE number 3238444 (Why is no real title available?)
- scientific article; zbMATH DE number 3261634 (Why is no real title available?)
- Minimal completely separating systems
- Minimal completely separating systems of \(k\)-sets
- On a problem concerning separating systems of a finite set
- On generalized graphs
- On separating systems
- On separating systems of a finite set
- On separating systems whose elements are sets of at most k elements
- Perfect Hashing and Probability
Cited in
(10)- Some new bounds for cover-free families through biclique covers
- Segre's hemisystem and McLaughlin's graph
- The complexity of two graph orientation problems
- Rainbow saturation and graph capacities
- Separating path systems
- Search when the lie depends on the target
- Separating path systems for the complete graph
- Separating path systems of almost linear size
- Covering complete hypergraphs with cuts of minimum total size
- On the biclique cover of the complete graph
This page was built for publication: Separating systems and oriented graphs of diameter two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864898)