. A note on extremal combinatorics of cyclic split systems.
Page 1 Next
Displaying 1 – 20 of 81
A Hilton-Milner theorem for vector spaces.
Blokhuis, A., Brouwer, A.E., Chowdhury, A., Frankl, P., Mussche, T., Patkós, B., Szönyi, T. (2010)
The Electronic Journal of Combinatorics [electronic only]
A new construction for cancellative families of sets.
Shearer, James B. (1996)
The Electronic Journal of Combinatorics [electronic only]
A note on -cross free families.
Suk, Andrew (2008)
The Electronic Journal of Combinatorics [electronic only]
A Sperner-type theorem for set-partition systems.
Meagher, Karen, Moura, Lucia, Stevens, Brett (2005)
The Electronic Journal of Combinatorics [electronic only]
An Attempt at Frankl's Conjecture
Petar Marković (2007)
Publications de l'Institut Mathématique
Barycentric-sum problems: a survey.
Ordaz, Oscar, Quiroz, Domingo (2007)
Divulgaciones Matemáticas
Bounds on the Turán density of PG(3, 2).
Cioabă, Sebastian M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Combinatorial formulae for multiple set-valued labellings.
Mau-Hsiang Shih, Shyh-Nan Lee (1993)
Mathematische Annalen
Combinatorics of singly-repairable families.
Luks, Eugene M., Roy, Amitabha (2005)
The Electronic Journal of Combinatorics [electronic only]
Constructing subsets of a given packing index in Abelian groups
Nadya Lyaskovska (2007)
Acta Universitatis Carolinae. Mathematica et Physica
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Klazar, Martin (2000)
The Electronic Journal of Combinatorics [electronic only]
Envy-free cake divisions cannot be found by finite protocols.
Stromquist, Walter (2008)
The Electronic Journal of Combinatorics [electronic only]
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Štefan Znám (1967)
Matematický časopis
Erdös-Ko-Rado from intersecting shadows
Gyula O.H. Katona, Ákos Kisvölcsey (2012)
Discussiones Mathematicae Graph Theory
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős-Ko-Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corresponding results.
Erdős-Ko-Rado theorems for uniform set-partition systems.
Meagher, Karen, Moura, Lucia (2005)
The Electronic Journal of Combinatorics [electronic only]
Erdős-Ko-Rado-type theorems for colored sets.
Li, Yu-Shuang, Wang, Jun (2007)
The Electronic Journal of Combinatorics [electronic only]
Evolutionary families of sets.
Little, C.H.C., Campbell, A.E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Extremal problems for -partite and -colorable hypergraphs.
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Extremal subsets of avoiding solutions to linear equations in three variables.
Hegarty, Peter (2007)
The Electronic Journal of Combinatorics [electronic only]
Currently displaying 1 – 20 of 81
Page 1 Next