Problems from CGCS Luminy, May 2007 (Q966173)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Problems from CGCS Luminy, May 2007	scientific article

Statements

scholarly article

0 references

Problems from CGCS Luminy, May 2007 (English)

0 references

Peter J. Cameron

0 references

European Journal of Combinatorics

0 references

publication date

27 April 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2009.03.045

0 references

0 references

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

0 references

0 references

Covering planar graphs with a fixed number of balls

0 references

The complexity of completing partial Latin squares

0 references

A simple construction for the Fischer-Griess monster group

0 references

A note on the stability number of an orthogonality graph

0 references

0 references

Bounds on the Maximum Number of Vectors with given Scalar Products

0 references

Forbidden Intersections

0 references

0 references

0 references

0 references

An Elementary Problem Equivalent to the Riemann Hypothesis

0 references

New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming

0 references

Algebraic invariants of graphs; a study based on computer exploration

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejc.2009.03.045

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:966173

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q966173&oldid=35167731"