RSA 2008 - PDF Preprint Papers

RSA 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed RSA-2008 Paper

click to vote

RSA
2008

125views more RSA 2008»

The game chromatic number of random graphs

13 years 11 months ago

Download www.math.ucla.edu

: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...

Tom Bohman, Alan M. Frieze, Benny Sudakov

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	125	The game chromatic number of random graphs	claim
2	123	Generating unlabeled connected cubic planar graphs uniformly at random	claim
3	118	The cover time of the giant component of a random graph	claim
4	103	What is the furthest graph from a hereditary property?	claim
5	94	The cycle structure of two rows in a random Latin square	claim
6	94	Random mappings with exchangeable in-degrees	claim
7	89	Simple permutations mix even better	claim
8	87	A combinatorial approach to jumping particles: The parallel TASEP	claim
9	85	Quasi-random graphs with given degree sequences	claim
10	85	On a universal best choice algorithm for partially ordered sets	claim
11	84	Random partitions with restricted part sizes	claim
12	81	Analyzing linear mergers	claim
13	81	Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales	claim
14	80	A spectral technique for random satisfiable 3CNF formulas	claim
15	80	The persistent-access-caching algorithm	claim
16	78	How many random edges make a dense hypergraph non-2-colorable?	claim
17	70	Distribution of subgraphs of random regular graphs	claim
18	69	On variants of the Johnson-Lindenstrauss lemma	claim
19	69	Local resilience of graphs	claim
20	67	Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms	claim
21	65	Eigenvalues of Euclidean random matrices	claim
22	63	The cutoff phenomenon for randomized riffle shuffles	claim
23	63	On the size of the algebraic difference of two random Cantor sets	claim
24	58	The isoperimetric constant of the random graph process	claim
25	53	Sampling independent sets in the discrete torus	claim
26	47	Packing vertices and edges in random regular graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers