The Minimum Number of Edges in Uniform Hypergraphs with Property O. (19th December 2017)
- Record Type:
- Journal Article
- Title:
- The Minimum Number of Edges in Uniform Hypergraphs with Property O. (19th December 2017)
- Main Title:
- The Minimum Number of Edges in Uniform Hypergraphs with Property O
- Authors:
- DUFFUS, DWIGHT
KAY, BILL
RÖDL, VOJTĚCH - Abstract:
- Abstract : An oriented k -uniform hypergraph (a family of ordered k -sets) has the ordering property (or Property O) if, for every linear order of the vertex set, there is some edge oriented consistently with the linear order. We find bounds on the minimum number of edges in a hypergraph with Property O.
- Is Part Of:
- Combinatorics, probability and computing. Volume 27:Number 4(2018)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 27:Number 4(2018)
- Issue Display:
- Volume 27, Issue 4 (2018)
- Year:
- 2018
- Volume:
- 27
- Issue:
- 4
- Issue Sort Value:
- 2018-0027-0004-0000
- Page Start:
- 531
- Page End:
- 538
- Publication Date:
- 2017-12-19
- Subjects:
- Primary 05C65, -- Secondary 05C35, -- 05D40
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S096354831700058X ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 6830.xml