The following pages link to (Q3996173):
Displaying 45 items.
- Learning a hidden graph (Q479267) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- Whist tournaments -- three person property (Q686420) (← links)
- Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution (Q697994) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Asymptotic existence theorems for frames and group divisible designs (Q878009) (← links)
- Regular LDPC codes from semipartial geometries (Q925272) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- More ZCPS-Wh\((v)\) and several new infinite classes of Z-cyclic whist tournaments (Q1130182) (← links)
- Steiner triple systems with near-rotational automorphisms (Q1200008) (← links)
- On compressing complete designs (Q1298922) (← links)
- Cyclic Whist tournaments (Q1322239) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Generating new designs using union operations (Q1328824) (← links)
- \(Z\)-cyclic whist tournaments with a patterned starter initial round (Q1331891) (← links)
- Balanced Steiner triple systems (Q1356043) (← links)
- Intersection-sets in \(PG(n,2)\) (Q1365489) (← links)
- Construction of referee squares (Q1377852) (← links)
- Classification of whist tournaments with up to 12 players (Q1406035) (← links)
- A construction of group divisible designs with block sizes 3 to 7 (Q1752545) (← links)
- A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
- On primitivity and reduction for flag-transitive symmetric designs (Q1763878) (← links)
- A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme (Q1787755) (← links)
- Equitable embeddings of Steiner triple systems (Q1906137) (← links)
- An infinite class of \(Z\)-cyclic whist tournaments on \(v\) players, \(v\equiv 1\pmod 4\) (Q1917309) (← links)
- Decompositions of edge-colored complete graphs (Q1971615) (← links)
- A family of group divisible designs with arbitrary block sizes (Q2279385) (← links)
- New constructions of quantum stabilizer codes based on difference sets (Q2333939) (← links)
- QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY (Q3006052) (← links)
- Using combinatorial designs to construct partial concentrators (Q3351369) (← links)
- (Q3718724) (← links)
- (Q4039966) (← links)
- Construction of skolem sequences (Q4236116) (← links)
- The size of minimum 3-trees: Cases 3 and 4 mod 6 (Q4237725) (← links)
- Designs from projective planes and PBD bases (Q4262992) (← links)
- New constructions for covering designs (Q4373370) (← links)
- A representation theorem and Z‐cyclic whist tournaments (Q4373387) (← links)
- A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs” (Q4373401) (← links)
- Daisy structure in Desarguesian projective planes (Q4431475) (← links)
- On cliques in spanning graphs of projective Steiner triple systems (Q4487079) (← links)
- Cyclically resolvable designs and triple whist tournaments (Q4698408) (← links)
- Z‐cyclic triplewhist tournaments when the number of players involves primes of the form 8u + 5 (Q4698415) (← links)
- The 2‐intersection number of paths and bounded‐degree trees (Q4842702) (← links)
- Imbedding with a prime (Q5301028) (← links)
- Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (Q5862313) (← links)
