A solution of a problem of B. Rotman
E. Grzegorek (1977)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Set theoretical analogues of two combinatorial theorems”
A solution of a problem of B. Rotman
A solution of a problem of B. Rotman
A. R. D. Mathias (1977)
Colloquium Mathematicae
Similarity:
Some problems of combinatorial number theory related to Bertrand's postulate.
Greenfield, Lawrence E., Greenfield, Stephen J. (1998)
Journal of Integer Sequences [electronic only]
Similarity:
The number of certain -combinations of an -set.
Wieder, Thomas (2008)
Applied Mathematics E-Notes [electronic only]
Similarity:
The stack-size of combinatorial tries revisited.
Nebel, Markus K. (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On choosing subsets of n-element sets
M. Zuckerman (1969)
Fundamenta Mathematicae
Similarity:
On certain combinatorial identities
Robert Bartoszyński (1974)
Colloquium Mathematicae
Similarity:
Antichains on three levels.
Lieby, Paulette (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On sumfree subsets of hypercubes
Daniel J. Katz (2009)
Acta Arithmetica
Similarity:
A generalized recurrence for Bell numbers.
Spivey, Michael Z. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Combinatorial proofs of some Simons-type binomial coefficient identities.
Shattuck, Mark (2007)
Integers
Similarity:
On the -core of an -core partition.
Nath, Rishi (2008)
Integers
Similarity:
The intersection structure of -intersecting families.
Talbot, John (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: