Research problems from the 19th British Combinatorial Conference
From MaRDI portal
Publication:1779507
DOI10.1016/j.disc.2005.02.006zbMath1062.05003OpenAlexW2917664358MaRDI QIDQ1779507
Publication date: 1 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.006
Related Items (8)
On linear codes whose weights and length have a common divisor ⋮ On a problem concerning piles of counters ⋮ The Proofs of Two Directed Paths Conjectures of Bollobás and Leader ⋮ Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice ⋮ On optimality of designs with three distinct eigenvalues ⋮ Bipartite graphs with five eigenvalues and pseudo designs ⋮ Symmetric ‐Designs and ‐Difference Sets ⋮ Shape of the asymptotic maximum sum-free sets in integer lattice grids
Uses Software
Cites Work
- Critical hypergraphs and interesting set-pair systems
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Matchings and paths in the cube
- Enumeration of cospectral graphs.
- Combinatorial designs with two singular values. II: Partial geometric designs
- Block designs: a randomization approach. Vol. 2: Design
- Optimality of partial geometric designs
- Finite embedding theorems for partial Latin squares, quasi-groups, and loops
- Finding tight single-change covering designs with \(v=20, k=5\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Research problems from the 19th British Combinatorial Conference
