NDLI: Online vertex-coloring games in random graphs

Content Provider	Springer Nature Link
Author	Spöhel, Reto Marciniszyn, Martin
Copyright Year	2010
Abstract	Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly revealed vertex to preceding vertices are revealed. The player has a fixed number of colors at her disposal, and has to assign one of these to each vertex immediately. However, she is not allowed to create any monochromatic copy of some fixed graph F in the process.For n → ∞, we study how the limiting probability that the player can color all n vertices in this online fashion depends on the edge density of the underlying random graph. For a large family of graphs F, including cliques and cycles of arbitrary size, and any fixed number of colors, we establish explicit threshold functions for this edge density. In particular, we show that the order of magnitude of these threshold functions depends on the number of colors, which is in contrast to the corresponding offline coloring problem.
Ending Page	123
Page Count	19
Starting Page	105
File Format	PDF
ISSN	02099683
e-ISSN	14396912
Journal	Combinatorica
Issue Number	1
Volume Number	30
Language	English
Publisher	Springer-Verlag
Publisher Date	2010-09-17
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Random graphs Mathematics Combinatorics Coloring of graphs and hypergraphs
Content Type	Text
Resource Type	Article
Subject	Discrete Mathematics and Combinatorics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Vertex-Colouring Edge-Weightings

The concentration of the chromatic number of random graphs

Circumference, chromatic number and online coloring

On the chromatic number of random geometric graphs

Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem

On The Span Of A Random Channel Assignment Problem

Chromatic number and complete graph substructures for degree sequences

The choice number of random bipartite graphs

Independent systems of representatives in weighted graphs

Online vertex-coloring games in random graphs

Similar Documents

Vertex-Colouring Edge-Weightings

The concentration of the chromatic number of random graphs

Circumference, chromatic number and online coloring

On the chromatic number of random geometric graphs

Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem

On The Span Of A Random Channel Assignment Problem

Chromatic number and complete graph substructures for degree sequences

The choice number of random bipartite graphs

Independent systems of representatives in weighted graphs

Online vertex-coloring games in random graphs