The saturation number of induced subposets of the Boolean lattice
Authors:
- Michael FerraraMFMichael Ferrara
- Bill KayBKBill Kay
- Lucas KramerLKLucas Kramer
- Ryan R. MartinRMRyan R. Martin
- Benjamin ReinigerBRBenjamin Reiniger
- Heather C. SmithHSHeather C. Smith
- Eric SullivanESEric Sullivan
- 1 October 2017
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (10) , 2479-2487
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF-DMS (#1427526)
- Simons Foundation (#426971)
- Simons Foundation (#353292)
- NSF-DMS (#1344199)
This publication has 8 references indexed in Scilit:
- On Saturated $k$-Sperner SystemsThe Electronic Journal of Combinatorics, 2014
- Induced saturation numberDiscrete Mathematics, 2012
- Saturating Sperner FamiliesGraphs and Combinatorics, 2012
- Berge trigraphsJournal of Graph Theory, 2006
- Bipartite dimensions and bipartite degrees of graphsDiscrete Mathematics, 1996
- A Problem in Graph TheoryThe American Mathematical Monthly, 1964
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928