EJC
2008
15 years 19 days ago
2008
84
Voted
EJC
2008
15 years 19 days ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
90
Voted
EJC
2008
15 years 19 days ago
2008
103
Voted
EJC
2008
15 years 19 days ago
2008
Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
100
Voted
EJC
2008
15 years 19 days ago
2008
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
91
Voted
EJC
2008
15 years 19 days ago
2008
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
EJC
2008
15 years 19 days ago
2008
A linear deformation of a Meyer set M in Rd is the image of M under a group homomorphism of the group [M] generated by M into Rd . We provide a necessary and sufficient condition f...
109
click to vote
EJC
2008
15 years 19 days ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
135
click to vote
EJC
2008
15 years 19 days ago
2008
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
106
Voted
EJC
2008
15 years 19 days ago
2008
In 2004, Cs