4 citations · 11 across the 23 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Nonexistence Results for Tight Block Designs
Peter Dukes, Jesse Short-Gershman
Recall that combinatorial -designs admit a classical lower bound on their number of blocks, and that a design meeting this bound is called tight. A long-st…
math.CO2011★ 4 cited
Fractional edge-decompositions of dense graphs and related eigenvalues
Peter J. Dukes
We consider the problem of decomposing some -uniform hypergraph into copies of another, say , with nonnegative rational weights. For fixed on vertices, we show th…