Esther R. Lamken
Esther R. Lamken has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Peter J. Dukes
Department of Mathematics and Statistics University of Victoria Victoria B.C Canada
2 shared publications - Alan Chi Hung Ling
Department of Computer Science, University of Vermont, Burlington, USA
1 shared publication - Charles J. Colbourn
Arizona State University
1 shared publication - Chengmin Wang
School of Science Jiangnan University Wuxi 214122 P.R. China
1 shared publication - Jinhua Wang
School of Sciences, Nantong University, Nantong, People’s Republic of China
1 shared publication - Nigel Chan
School of Mathematics and Statistics University of New South Wales N.S.W. 2052 Australia
1 shared publication
Latest Publications
- 29 May 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (12) , 2729-2751
Constructions and uses of incomplete pairwise balanced designs
- 29 May 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (12) , 2729-2751
Constructions and uses of incomplete pairwise balanced designs
- Open Access
- 14 October 2016
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 23 (4) , P4.24
Resolvable Group Divisible Designs with Large Groups
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new results on decompositions of complete multipartite graphs into a prescribed graph.
- 14 October 2016
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 23 (4) , P4.24
Open AccessResolvable Group Divisible Designs with Large Groups
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new results on decompositions of complete multipartite graphs into a prescribed graph.
- 14 January 2013
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 21 (8) , 342-358
Doubly Resolvable Nearly Kirkman Triple Systems
- 14 January 2013
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 21 (8) , 342-358
Doubly Resolvable Nearly Kirkman Triple Systems
- 1 July 2009
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 17 (6) , 425-447
Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
Two resolutions R and R′ of a combinatorial design are called orthogonal if |Ri∩R|≤1 for all Ri∈R and R∈R′. A set Q={R1, R2, …, Rd} of d resolutions of a combinatorial design is called a set of mutually orthogonal resolutions (MORs) if the resolutions of Q are pairwise orthogonal. In this paper, we establish necessary and sufficient conditions for the asymptotic existence of a (v, k, 1)‐BIBD with d mutually orthogonal resolutions for d≥2 and k≥3 and necessary and sufficient conditions for the asymptotic existence of a (v, k, k−1)‐BIBD with d mutually orthogonal near resolutions for d≥2 and k≥3. We use complementary designs and the most general form of an asymptotic existence theorem for decompositions of edge‐colored complete digraphs into prespecified edge‐colored subgraphs. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 425–447, 2009
- 1 July 2009
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 17 (6) , 425-447
Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
Two resolutions R and R′ of a combinatorial design are called orthogonal if |Ri∩R|≤1 for all Ri∈R and R∈R′. A set Q={R1, R2, …, Rd} of d resolutions of a combinatorial design is called a set of mutually orthogonal resolutions (MORs) if the resolutions of Q are pairwise orthogonal. In this paper, we establish necessary and sufficient conditions for the asymptotic existence of a (v, k, 1)‐BIBD with d mutually orthogonal resolutions for d≥2 and k≥3 and necessary and sufficient conditions for the asymptotic existence of a (v, k, k−1)‐BIBD with d mutually orthogonal near resolutions for d≥2 and k≥3. We use complementary designs and the most general form of an asymptotic existence theorem for decompositions of edge‐colored complete digraphs into prespecified edge‐colored subgraphs. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 425–447, 2009