330 search results - page 30 / 66 » Compressing Bounded Degree Graphs |
EJC
2008
14 years 9 months 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-...
COMBINATORICA
2008
14 years 9 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
COMBINATORICA
2007
14 years 9 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
JGT
2010
14 years 8 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...