617 search results - page 49 / 124 » On the Chromatic Number of Random Graphs |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
108
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
117
click to vote
MST
2011
14 years 6 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...