The following pages link to (Q5661892):
Displayed 50 items.
- Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\) (Q295269) (← links)
- On the existence of unparalleled even cycle systems (Q326644) (← links)
- Generalized packing designs (Q385379) (← links)
- Constructions for large sets of \(v-1\{0,{v\over 3}\}\)-intersecting Steiner triple systems of order \(v\) (Q390277) (← links)
- \(f\)-vectors of pure complexes and pure multicomplexes of rank three (Q394354) (← links)
- A new result on Sylvester's problem (Q397135) (← links)
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
- Overlarge sets of resolvable idempotent quasigroups (Q408186) (← links)
- The intersection numbers of KTSs with a common parallel class (Q449131) (← links)
- The achromatic number of Kneser graphs (Q510596) (← links)
- Direct constructions of large sets of Kirkman triple systems (Q517263) (← links)
- The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\) (Q658058) (← links)
- Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) (Q659751) (← links)
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- Hanani triple systems (Q690071) (← links)
- The triangle intersection numbers of a pair of disjoint \(S(2,4,v)\)s (Q710603) (← links)
- The triangle intersection problem for \(S(2,4,v)\) designs (Q712237) (← links)
- Resolvable group divisible designs with block size 3 (Q750444) (← links)
- On linear k-arboricity (Q761470) (← links)
- On the cover Ramsey number of Berge hypergraphs (Q776301) (← links)
- A new extremal property of Steiner triple-systems (Q801918) (← links)
- A construction of optimal constant composition codes (Q851744) (← links)
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs (Q871281) (← links)
- On combinatorial designs with subdesigns (Q908920) (← links)
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) (Q914680) (← links)
- The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\) (Q914681) (← links)
- Balanced tournament designs and resolvable (v,3,2)-BIBDs (Q917554) (← links)
- P\({}_ 3\)-factorization of complete multipartite graphs (Q920114) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- Further results on large sets of Kirkman triple systems (Q942094) (← links)
- On the existence of maximum resolvable (\(K_{4} - e\))-packings (Q965971) (← links)
- On overlarge sets of Kirkman triple systems (Q982618) (← links)
- On the existence of nearly Kirkman triple systems with subsystems (Q1009018) (← links)
- Kirkman covering designs with even-sized holes (Q1024451) (← links)
- Complete solutions to the Oberwolfach problem for an infinite set of orders (Q1044208) (← links)
- Resolvable BIBD and SOLS (Q1050343) (← links)
- Pairwise balanced designs whose line sizes do not divide six (Q1053695) (← links)
- On generalized Ramsey numbers for trees (Q1062076) (← links)
- Spreads and packings for a class of \(((2^ n+1)\) \((2^{n-1}-1)+1,2^{n-1},1)\)-designs (Q1062990) (← links)
- On strong starters in cyclic groups (Q1066268) (← links)
- Resolvable path designs (Q1070250) (← links)
- Frames for Kirkman triple systems (Q1106226) (← links)
- Frames and the \(g^{(k)}(v)\) problem (Q1109034) (← links)
- Uniformly resolvable pairwise balanced designs with blocksizes two and three (Q1112035) (← links)
- The existence of resolvable Steiner quadruple systems (Q1114691) (← links)
- The family of t-designs. Part I (Q1146481) (← links)
- Extended (2,4)-designs (Q1146679) (← links)
- More generalized packing numbers (Q1162517) (← links)
- Partitioning Steiner triple systems into complete arcs (Q1176742) (← links)
- Class-uniformly resolvable pairwise balanced designs with block size two and three (Q1182939) (← links)