Pages that link to "Item:Q1063598"
From MaRDI portal
The following pages link to On the number of distinct block sizes in partitions of a set (Q1063598):
Displaying 19 items.
- Statistics of blocks in \(k\)-divisible non-crossing partitions (Q456303) (← links)
- Average values of some Z-parameters in a random set partition (Q665748) (← links)
- Partitions of multisets. II (Q801912) (← links)
- Partitionable sets and cyclic BSECs with block size four (Q1011536) (← links)
- Three problems in combinatorial asymptotics (Q1050342) (← links)
- The asymptotic number of set partitions with unequal block sizes (Q1277138) (← links)
- Random set partitions: Asymptotics of subset counts (Q1364237) (← links)
- Limiting distributions for the number of distinct component sizes in relational structures (Q1369674) (← links)
- Erratum to ``Limiting distributions for the number of distinct component sizes in relational structures'' (Q1395831) (← links)
- Block size in geometric(\(p\))-biased permutations (Q1990049) (← links)
- Erdős-Ko-Rado theorems for set partitions with certain block size (Q2299629) (← links)
- The number of small blocks in exchangeable random partitions (Q2865819) (← links)
- The Rand and Block Distances of Pairs of Set Partitions (Q3111658) (← links)
- Partitions with Restricted Block Sizes, Möbius Functions, and the <i>k</i>-of-Each Problem (Q3128201) (← links)
- A Random Graph With a Subcritical Number of Edges (Q3807259) (← links)
- Gap‐Free Set Partitions (Q3989738) (← links)
- (Q5026930) (← links)
- Upper bounds on the average number of colors in the non-equivalent colorings of a graph (Q6045131) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)