Maximum Packings and Minimum Coverings

Design Theory ◽  
2017 ◽  
pp. 77-93
Keyword(s):  
Maximum Packings

scholarly journals Embeddings of simple maximum packings of triples with λ even

1995 ◽  
Vol 145 (1-3) ◽  
pp. 191-200 ◽  
Author(s):  
Salvatore Milici ◽  
Gaetano Quattrocchi ◽  
Hao Shen
Keyword(s):  
Maximum Packings

scholarly journals Maximum packings with odd cycles

1994 ◽  
Vol 131 (1-3) ◽  
pp. 91-97 ◽  
Author(s):  
Saad I. El-Zanati
Keyword(s):  
Odd Cycles ◽  
Maximum Packings

scholarly journals The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles

1998 ◽  
Vol 183 (1-3) ◽  
pp. 103-117 ◽  
Author(s):  
H.-L. Fu ◽  
C.C. Lindner
Keyword(s):  
Maximum Packings

Weakly union-free maximum packings

1999 ◽  
Vol 3 (1) ◽  
pp. 43-52 ◽  
Author(s):  
Charles J. Colbourn
Keyword(s):  
Maximum Packings

scholarly journals Minimal Overlapping Patterns in Colored Permutations

10.37236/2021 ◽  
2011 ◽  
Vol 18 (2) ◽  
Author(s):  
Adrian Duane ◽  
Jeffrey Remmel
Keyword(s):  
General Formula ◽  
Generating Function ◽  
Minimal Length ◽  
Special Cases ◽  
Maximum Packings ◽  
Colored Permutations

A pattern $P$ of length $j$ has the minimal overlapping property if two consecutive occurrences of the pattern can overlap in at most one place, namely, at the end of the first consecutive occurrence of the pattern and at the start of the second consecutive occurrence of the pattern. For patterns $P$ which have the minimal overlapping property, we derive a general formula for the generating function for the number of consecutive occurrences of $P$ in words, permutations and $k$-colored permutations in terms of the number of maximum packings of $P$ which are patterns of minimal length which has $n$ consecutive occurrences of the pattern $P$. Our results have as special cases several results which have appeared in the literature. Another consequence of our results is to prove a conjecture of Elizalde that two permutations $\alpha$ and $\beta$ of size $j$ which have the minimal overlapping property are strongly $c$-Wilf equivalent if $\alpha$ and $\beta$ have the same first and last elements.

Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles

2010 ◽  
Vol 27 (2) ◽  
pp. 161-170 ◽  
Author(s):  
Elizabeth J. Billington ◽  
Italo J. Dejter ◽  
D. G. Hoffman ◽  
C. C. Lindner
Keyword(s):  
Complete Graphs ◽  
Maximum Packings

scholarly journals On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4

2021 ◽  
Vol 9 (2) ◽  
pp. 451
Author(s):  
Amber Armstrong ◽  
Ryan C. Bunge ◽  
William Duncan ◽  
Saad I. El-Zanati ◽  
Kristin Koe ◽  
...  
Keyword(s):  
Uniform Hypergraphs ◽  
Maximum Packings

scholarly journals Tight blocking sets in some maximum packings of λKn

2008 ◽  
Vol 308 (2-3) ◽  
pp. 427-438 ◽  
Author(s):  
Yanxun Chang ◽  
Giovanni Lo Faro ◽  
Antoinette Tripodi
Keyword(s):  
Blocking Sets ◽  
Maximum Packings
Sign in / Sign up

Export Citation Format

Share Document