Random lifts of graphs III: Independence and chromatic number

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003243" target="_blank" >RIV/00216208:11320/02:00003243 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Random lifts of graphs III: Independence and chromatic number

Original language description

For a graph G, a random n-lift of G has the vertex set V(G)x[n] and for each edge uv of G, there is a random matching between {u}x[n] and {v}x[n]$. We present bounds on the chromatic number and on the independence number of typical random lifts.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Random Structures and Algorithms

ISSN

1042-9832

e-ISSN

—

Volume of the periodical

20

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

22

Pages from-to

1-22

UT code for WoS article

—

EID of the result in the Scopus database

—