The following pages link to (Q5181380):
Displayed 36 items.
- Pairwise balanced designs and sigma clique partitions (Q271601) (← links)
- Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees (Q274673) (← links)
- Packing minor closed families of graphs (Q322346) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- On the cover Ramsey number of Berge hypergraphs (Q776301) (← links)
- Asymptotic existence theorems for frames and group divisible designs (Q878009) (← links)
- The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs (Q887440) (← links)
- On combinatorial designs with subdesigns (Q908920) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- Smallest defining sets of directed triple systems (Q1044953) (← links)
- Coverings pairs by quintuples: The case v congruent to 3 (mod 4) (Q1116950) (← links)
- On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays (Q1146190) (← links)
- The family of t-designs. Part I (Q1146481) (← links)
- On designs related to coherent configurations of type \((^ 2\;^ 2_ 4)\) (Q1182975) (← links)
- The edge-coloring of complete hypergraphs. I (Q1260045) (← links)
- Some recent developments on BIBDs and related designs (Q1313979) (← links)
- The existence of resolvable BIBD with \(\lambda=1\) (Q1594861) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Equiangular tight frames with centroidal symmetry (Q1690710) (← links)
- A hypergraph extension of the bipartite Turán problem (Q1826942) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
- Quantum structures without group-valued measures (Q2239396) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Mutually orthogonal Latin squares with large holes (Q2343836) (← links)
- Grid-block difference families and related combinatorial structures (Q2421868) (← links)
- On 2-colored graphs and partitions of boxes (Q2422239) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Resolvable block designs in construction of approximate real MUBs that are sparse (Q2673769) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Orthogonal arrays and designs for partial triallel crosses (Q5085563) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Resolvable balanced incomplete block designs with block size 5 (Q5935427) (← links)
- Partitioned difference families and harmonious linear spaces (Q6063230) (← links)
- Graph and hypergraph packing (Q6198635) (← links)