On Kramer–Mesner matrix partitioning conjecture
✍ Scribed by Yoomi Rho
- Book ID
- 108114204
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 351 KB
- Volume
- 310
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We propose a combination of two known computational methods for the construction of designs with prescribed groups of automorphisms: the Kramer-Mesner method and the method of tactical decompositions. This combined method is used to construct new unitals with parameters 2-(65, 5, 1).
Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa