Forbidden Subposets in the Cycle Poset
Open Access
- 26 August 2024
- journal article
- research article
- Published by Springer Nature in Order
- Vol. 42 (1) , 241-250
Abstract
The cycle poset consists of the intervals of the cyclic permutation of the elements 1, 2, ..., n, ordered by inclusion. Suppose that
F
is a set of such intervals, none of them is a less than
s
others. The maximum size of
F
is determined under this condition. It is also shown that if the largest size of a set in this poset without containing a small subposet
P
is known, it solves the same problem, up to an additive constant, in the grid poset consisting of the pairs $$(i,j) (1\le i,j\le n)$$ and ordered coordinate-wise.
Keywords
Funding Information
- University of Kashan (985985/5)
- National Research, Development, and Innovation Office - NKFIH (SSN135643 and K132696)
This publication has 8 references indexed in Scilit:
- Forbidden subposet problems in the gridDiscrete Mathematics, 2022
- Progress on poset-free families of subsets2016
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)2008
- Largest family withoutJournal of Combinatorial Theory, Series A, 2005
- Extremal hypergraph problems and convex hullsCombinatorica, 1985
- Extremal problems with excluded subgraphs in the n-cube1983
- A simple proof of the Erdös-Chao Ko-Rado theoremJournal of Combinatorial Theory, Series B, 1972
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928