Relevant bibliographies by topics / Sperner partition systems

Academic literature on the topic 'Sperner partition systems'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Sperner partition systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Sperner partition systems"

1

Li, P. C., and Karen Meagher. "Sperner Partition Systems." Journal of Combinatorial Designs 21, no. 7 (August 16, 2012): 267–79. http://dx.doi.org/10.1002/jcd.21330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gowty, Adam, and Daniel Horsley. "More constructions for Sperner partition systems." Journal of Combinatorial Designs 29, no. 9 (June 4, 2021): 579–606. http://dx.doi.org/10.1002/jcd.21780.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Yanxun, Charles J. Colbourn, Adam Gowty, Daniel Horsley, and Junling Zhou. "New bounds on the maximum size of Sperner partition systems." European Journal of Combinatorics 90 (December 2020): 103165. http://dx.doi.org/10.1016/j.ejc.2020.103165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Meagher, Karen, Lucia Moura, and Brett Stevens. "A Sperner-Type Theorem for Set-Partition Systems." Electronic Journal of Combinatorics 12, no. 1 (October 31, 2005). http://dx.doi.org/10.37236/1987.

Full text
Abstract:
A Sperner partition system is a system of set partitions such that any two set partitions $P$ and $Q$ in the system have the property that for all classes $A$ of $P$ and all classes $B$ of $Q$, $A \not\subseteq B$ and $B \not\subseteq A$. A $k$-partition is a set partition with $k$ classes and a $k$-partition is said to be uniform if every class has the same cardinality $c=n/k$. In this paper, we prove a higher order generalization of Sperner's Theorem. In particular, we show that if $k$ divides $n$ the largest Sperner $k$-partition system on an $n$-set has cardinality ${n-1 \choose n/k-1}$ and is a uniform partition system. We give a bound on the cardinality of a Sperner $k$-partition system of an $n$-set for any $k$ and $n$.
APA, Harvard, Vancouver, ISO, and other styles
5

Erdős, Péter L., Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, and Balázs Patkós. "Two-Part Set Systems." Electronic Journal of Combinatorics 19, no. 1 (March 9, 2012). http://dx.doi.org/10.37236/2067.

Full text
Abstract:
The two part Sperner theorem of Katona and Kleitman states that if $X$ is an $n$-element set with partition $X_1 \cup X_2$, and $\mathcal{F}$ is a family of subsets of $X$ such that no two sets $A, B \in \mathcal{F}$ satisfy $A \subset B$ (or $B \subset A$) and $A \cap X_i=B\cap X_i$ for some $i$, then $|\mathcal{F}| \le {n \choose \lfloor n/2\rfloor}$. We consider variations of this problem by replacing the Sperner property with the intersection property and considering families that satisfy various combinations of these properties on one or both parts $X_1$, $X_2$. Along the way, we prove the following new result which may be of independent interest: let $\mathcal{F},\mathcal{G}$ be intersecting families of subsets of an $n$-element set that are additionally cross-Sperner, meaning that if $A \in\mathcal{F}$ and $B \in \mathcal{G}$, then $A \not\subset B$ and $B \not\subset A$. Then $|\mathcal{F}| +|\mathcal{G}| \le 2^{n-1}$ and there are exponentially many examples showing that this bound is tight.
APA, Harvard, Vancouver, ISO, and other styles
6

Maltais, Elizabeth, Lucia Moura, and Mike Newman. "Binary Covering Arrays on Tournaments." Electronic Journal of Combinatorics 25, no. 2 (June 22, 2018). http://dx.doi.org/10.37236/6149.

Full text
Abstract:
We introduce graph-dependent covering arrays which generalize covering arrays on graphs, introduced by Meagher and Stevens (2005), and graph-dependent partition systems, studied by Gargano, Körner, and Vaccaro (1994). A covering array $\hbox{CA}(n; 2, G, H)$ (of strength 2) on column graph $G$ and alphabet graph $H$ is an $n\times |V(G)|$ array with symbols $V(H)$ such that for every arc $ij \in E(G)$ and for every arc $ab\in E(H)$, there exists a row $\vec{r} = (r_{1},\dots, r_{|V(G)|})$ such that $(r_{i}, r_{j}) = (a,b)$. We prove bounds on $n$ when $G$ is a tournament graph and $E(H)$ consists of the edge $(0,1)$, which corresponds to a directed version of Sperner's 1928 theorem. For two infinite families of column graphs, transitive and so-called circular tournaments, we give constructions of covering arrays which are optimal infinitely often.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography