t-designs on hypergraphs

From MaRDI portal
Publication:1239745

DOI10.1016/0012-365X(76)90030-3zbMath0362.05049MaRDI QIDQ1239745

Earl S. Kramer, Dale M. Mesner

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items (74)

More mutually disjoint Steiner systems \(S(5,8,24)\)On the large sets of \(t\)-designs of size nineIntersection Matrices RevisitedTransitive Steiner triple systems of order 25Classification of 6‐(14,7,4) designs with nontrivial automorphism groupsPartial geometric designs with prescribed automorphismsNew infinite series of 2-designs over the binary and ternary fieldTwo 5-designs on 32 pointsSome new families of 3-regular self-complementary \(k\)-hypergraphsThe existence of simple \(6\text{-}(14,7,4)\) designsAn incidence algebra for t-designs with automorphismsNon-embeddable quasi-residual quasi-symmetric designsLarge sets of \(t\)-designs through partitionable sets: a surveyq-Analogs of Packing DesignsOn the Possible Automorphism Groups of a Steiner Quintuple System of Order 21On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7)Bounding graphical \(t\)-wise balanced designsUnnamed ItemEnumeration of small nonisomorphic 1-rotational twofold triple systemsVector space partitions of GF(2)^8Quasi-symmetric \(2\)-\((28,12,11)\) designs with an automorphism of order \(5\)Block designs from self-dual codes obtained from Paley designs and Paley graphsHigher incidence matrices and tactical decomposition matricesBussey systems and Steiner's tactical problemThe order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most twoA new series of large sets of subspace designs over the binary fieldPartial geometric designs having circulant concurrence matricesPartitionable sets, almost partitionable sets, and their applicationsDominating sets for uniform subset graphsEXISTENCE OF -ANALOGS OF STEINER SYSTEMSt-designs from the large Mathieu groupsConstructions of new matroids and designs over \(\mathbb{F}_q\)Large sets of \(t\)-designs over finite fieldsOrbits on the projective lineNonexistence of block-transitive 6-designsJanko sporadic group \(\mathrm{J}_2\) as automorphism group of 3-designsNew 2-designs over finite fields from derived and residual designsGraphical \(t\)-designs with block sizes three and fourSteiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\)The 2-rotational Steiner triple systems of order 25On the automorphism group of a binary \(q\)-analog of the Fano planeTactical decompositions of designs over finite fieldsLarge sets of subspace designsDisjoint \(q\)-Steiner systems in dimension 13New Lower Bounds for Binary Constant-Dimension Subspace CodesSimple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)On linear codes admitting large automorphism groupsOn graphical quintuple systemsA recursive construction for simple \(t\)-designs using resolutionsEquations for coefficients of tactical decomposition matrices for \(t\)-designsSimple \(t\)-designs: a recursive construction for arbitrary \(t\)Some new 6-(14, 7, 4) designsA construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)Some new large sets of \(t\)-designsSystematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designsHypergraphical \(t\)-designsNew coverings oft-sets with (t + 1)-setsLarge sets of t-designs from groupsConstructing two-weight codes with prescribed groups of automorphisms\(q\)-analogs of \(t\)-wise balanced designs from Borel subgroupsA family of $t$-regular self-complementary $k$-hypergraphsNew quasi-symmetric designs by the Kramer-Mesner methodClassifying 3- and 4-designs on 28 points invariant under the group S6(2)New 2-Edge-Balanced Graphs from Bipartite GraphsThe Kramer-Mesner method with tactical decompositions: some new unitals on 65 pointsA generalization of Connor's inequality to t-designs with automorphismsAutomorphisms of 2-(22,8,4) designsUnnamed ItemMaximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codesUnnamed ItemGraphical \(t\)-designs via polynomial Kramer-Mesner matricesNew \(t\)-designs and large sets of \(t\)-designsGraphical t-wise balanced designsSearch for combinatorial objects using lattice algorithms -- revisited



Cites Work


This page was built for publication: t-designs on hypergraphs