Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
parallel classes
Description:
Partitions of the blocks of a combinatorial design into classes in which each class covers every point exactly once.
Primary topic:
Advanced Combinatorial Mathematics (38%)
Related topics:
Advanced Combinatorial Mathematics (38%),
Mathematics and Applications (8%),
Finite Group Theory Research (7%)
OpenAlex ID:
keywords/parallel-classes
Solution of Kirkman’s schoolgirl problem
1971
·
D. K. Ray-Chaudhuri
, Richard M. Wilson
·
Proceedings of symposia in pure mathematics
·
360
Multi-class teaching–learning-based optimization for truss design with frequency constraints
2015
·
M. Farshchin
, C.V. Camp
, et al.
·
Engineering Structures
·
102
On parallelisms in finite projective spaces
1974
·
Albrecht Beutelspacher
·
Geometriae Dedicata
·
99
The Size of School Effects Compared to Teacher Effects: An Overview of the Research Literature
2003
·
Hans Luyten
·
School Effectiveness and School Improvement
·
78
Tables of Parameters of BIBDs with r⩽41 including Existence, Enumeration, and Resolvability Results
1985
·
Rudolf Mathon
, Alexander Rosa
·
North-Holland mathematics studies
·
70
Chain Geometries
1995
·
Armin Herzer
·
Elsevier eBooks
·
67
Almost all Steiner triple systems have perfect matchings
2020
·
Matthew Kwan
·
Proceedings of the London Mathematical Society
·
63
PDF
Uniformly resolvable pairwise balanced designs with blocksizes two and three
1987
·
Rolf Rees
·
Journal of Combinatorial Theory Series A
·
62
Classification of 3-(24, 12, 5) designs and 24-dimensional Hadamard matrices
1981
·
Noboru Ito
, Jeffrey S Leon
, et al.
·
Journal of Combinatorial Theory Series A
·
62
The Cyclic Parallelisms of PG(3,5)
1998
·
A.R. Prince
·
European Journal of Combinatorics
·
41
PDF
Constructions of uniform designs by using resolvable packings and coverings
2003
·
Kai-Tai Fang
, Xuan Lu
, et al.
·
Discrete Mathematics
·
40
PDF
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles.
2009
·
Mariusz Meszka
, Alexander Rosa
·
Australas. J Comb.
·
38
On extensions of nets
1982
·
Dieter Jungnickel
, Sharad Sane
·
Pacific Journal of Mathematics
·
38
PDF
Translation nets and fixed-point-free group automorphisms
1990
·
R.A Bailey
, D Jungnickel
·
Journal of Combinatorial Theory Series A
·
31
Resolvable perfect cyclic designs
1980
·
F.E Bennett
, E Mendelsohn
, et al.
·
Journal of Combinatorial Theory Series A
·
31
Parallel Classes: Differences and Similarities. Teacher Effects and School Effects in Secondary Schools
1998
·
Hans Luyten
, Rob de Jong
·
School Effectiveness and School Improvement
·
30
Class-uniformly resolvable pairwise balanced designs with block sizes two and three
1991
·
Esther Lamken
, Rolf Rees
, et al.
·
Discrete Mathematics
·
30
From a 1-Rotational RBIBD to a Partitioned Difference Family
2010
·
Marco Buratti
, Jie Yan
, et al.
·
The Electronic Journal of Combinatorics
·
29
PDF
The existence of resolvable Steiner quadruple systems
1987
·
Alan Hartman
·
Journal of Combinatorial Theory Series A
·
29
Resolvable Maximum Packings with Quadruples
2005
·
Gennian GE
, C. W. H. LAM
, et al.
·
Designs Codes and Cryptography
·
28
Resolvable Steiner Quadruple Systems for the Last 23 Orders
2005
·
L. Ji
, L. Zhu
·
SIAM Journal on Discrete Mathematics
·
28
Weak random sources, hitting sets, and BPP simulations
2002
·
A.E. Andreev
, A.E.F. Clementi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
27
On uniformly resolvable designs with block sizes 3 and 4
2009
·
Ernst Schuster
, Gennian Ge
·
Designs Codes and Cryptography
·
26
Maximum uniformly resolvable designs with block sizes 2 and 4
2008
·
J.H. Dinitz
, Alan C.H. Ling
, et al.
·
Discrete Mathematics
·
26
PDF
On the existence of cycle frames and almost resolvable cycle systems
2011
·
H. Cao
, M. Niu
, et al.
·
Discrete Mathematics
·
25
Show more works
View as search
Works count:
349
Citation count:
2,530
Year
Topic
Type