Traces of uniform families of sets.
Patkós, Balázs (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A new construction for cancellative families of sets.”
Traces of uniform families of sets.
The intersection structure of -intersecting families.
Talbot, John (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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]
Similarity:
Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version.
Hwang, K.-W., Kim, T., Jang, L.C., Kim, P., Sohn, Gyoyong (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Intersecting and cross-intersecting families of labeled sets.
Borg, Peter (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tightly packed families of sots
N. Williams (1976)
Fundamenta Mathematicae
Similarity:
On some extremum problem in the family of non-decreasing functions
Kośka, Marian (2015-11-10T12:13:34Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Geometrical properties of a family of compactifications.
Gingold, Yotam I., Gingold, Harry (2007)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
Note on generating all subsets of a finite set with disjoint unions.
Ellis, David (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Minimal weight in union-closed families.
Falgas-Ravry, Victor (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Isomorphism classes of maximal intersecting uniform families are few.
McKenna, Geoffrey (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generalisation of entity and referential integrity in relational databases
Mark Levene, George Loizou (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Entity and referential integrity are the most fundamental constraints that any relational database should satisfy. We re-examine these fundamental constraints in the context of incomplete relations, which may have null values of the types “value exists but is unknown” and “value does not exist”. We argue that in practice the restrictions that these constraints impose on the occurrences of null values in relations are too strict. We justify a generalisation of the said constraints wherein...