Problems from CGCS Luminy, May 2007
type: Item
instance of: scholarly article
title: Problems from CGCS Luminy, May 2007
zbMATH Open document ID: 1188.52001
author: Peter J. Cameron
published in: European Journal of Combinatorics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 52-02
zbMATH DE Number: 5702107
MaRDI profile type: Publication
full work available at URL: j.ejc.2009.03.045
OpenAlex ID: W2107877297
cites work: Q5545296
cites work: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
cites work: Q3975132
cites work: Covering planar graphs with a fixed number of balls
cites work: The complexity of completing partial Latin squares
cites work: A simple construction for the Fischer-Griess monster group
cites work: A note on the stability number of an orthogonality graph
cites work: Q4083446
cites work: Bounds on the Maximum Number of Vectors with given Scalar Products
cites work: Forbidden Intersections
cites work: Q4448760
cites work: Q3967564
cites work: Q4093457
cites work: An Elementary Problem Equivalent to the Riemann Hypothesis
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: Algebraic invariants of graphs; a study based on computer exploration
DOI: 10.1016/J.EJC.2009.03.045
Recommended article: Problem D. Froncek and M. Kubesa
Recommended article: Q5136674
Recommended article: Proceedings of the problem session
Recommended article: Q4352317
Recommended article: Revisiting Lambert's problem
Recommended article: Illumination problems and codes
Recommended article: Q3454292
Recommended article: Research problems from the BCC21
Recommended article: A “Luminous” Solution to the Basel Problem
description: scientific article; zbMATH DE number 5702107