53 search results - page 10 / 11 » A Note On Reed's Conjecture |
DCG
2008
13 years 5 months ago
2008
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
JCT
2000
13 years 5 months ago
2000
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
DAM
1998
13 years 5 months ago
1998
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
SIROCCO
2007
13 years 7 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
AIL
2008
13 years 5 months ago
2008
The notions of burden of proof and presumption are central to law, but as noted in McCormick on Evidence, they are also the slipperiest of any of the family of legal terms employe...