Problems from CGCS Luminy, May 2007
From MaRDI portal
Publication:966173
DOI10.1016/j.ejc.2009.03.045zbMath1188.52001OpenAlexW2107877297MaRDI QIDQ966173
Publication date: 27 April 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.045
Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (4)
Packing and covering with balls on Busemann surfaces ⋮ Gerechte designs with rectangular regions ⋮ Inside s-inner product sets and Euclidean designs ⋮ Packing and covering balls in graphs excluding a minor
Cites Work
- The complexity of completing partial Latin squares
- Covering planar graphs with a fixed number of balls
- A simple construction for the Fischer-Griess monster group
- A note on the stability number of an orthogonality graph
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Forbidden Intersections
- Bounds on the Maximum Number of Vectors with given Scalar Products
- An Elementary Problem Equivalent to the Riemann Hypothesis
- Algebraic invariants of graphs; a study based on computer exploration
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Problems from CGCS Luminy, May 2007
