Lower-bound conjecture for diamond-saturated families avoiding the extremes
Let be a positive integer, let be the Boolean lattice, and let be an induced--saturated family that avoids both and . Lower-bound conjecture for diamond-saturated families avoiding the extremes. There exists a universal constant such that
The conjecture seeks a stronger lower bound for induced--saturated families avoiding the two extreme sets; the source gives a construction of size and presents this lower bound as an open question.
References
- Michael Ferrara, Bill Kay, Lucas Kramer, Ryan R. Martin, Benjamin Reiniger, Heather C. Smith and Eric Sullivan, “The Saturation Number of Induced Subposets of the Boolean Lattice”, arXiv:1701.03010 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.