Maximum‐size antichains in random set‐systems1. Issue 2 (19th May 2016)
- Record Type:
- Journal Article
- Title:
- Maximum‐size antichains in random set‐systems1. Issue 2 (19th May 2016)
- Main Title:
- Maximum‐size antichains in random set‐systems1
- Authors:
- Collares, Maurício
Morris, Robert - Abstract:
- Abstract: We show that, for p n → ∞, the largest set in a p ‐random sub‐family of the power set of { 1, …, n } containing no k ‐chain has size ( k − 1 + o ( 1 ) ) p ( n n / 2 ) with high probability. This confirms a conjecture of Osthus. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 308–321, 2016
- Is Part Of:
- Random structures & algorithms. Volume 49:Issue 2(2016)
- Journal:
- Random structures & algorithms
- Issue:
- Volume 49:Issue 2(2016)
- Issue Display:
- Volume 49, Issue 2 (2016)
- Year:
- 2016
- Volume:
- 49
- Issue:
- 2
- Issue Sort Value:
- 2016-0049-0002-0000
- Page Start:
- 308
- Page End:
- 321
- Publication Date:
- 2016-05-19
- Subjects:
- Hypergraph containers -- antichains -- random set‐systems
Random graphs -- Periodicals
Mathematical analysis -- Periodicals
519 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1098-2418 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/rsa.20647 ↗
- Languages:
- English
- ISSNs:
- 1042-9832
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 7254.411950
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 571.xml