Research problems

DOI10.1016/0012-365X(94)90183-XzbMath0793.05132OpenAlexW4211085403MaRDI QIDQ5906513

No author found.

Publication date: 9 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90183-x

zbMATH Keywords

problemsProblems

Mathematics Subject Classification ID

Graph theory (05C99) Extremal combinatorics (05D99) Designs and configurations (05B99)

Related Items (8)

Decomposition of bi-colored square arrays into balanced diagonals ⋮ On the structure of 1-designs with at most two block intersection numbers ⋮ Topological methods for the existence of a rainbow matching ⋮ Colouring problems for symmetric configurations with block size 3 ⋮ Orthogonal Latin Rectangles ⋮ Every SOMA\((n - 2, n)\) is Trojan ⋮ Cyclically covering subspaces in \(\mathbb{F}_2^n\) ⋮ Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture

This page was built for publication: Research problems