Random lifts of graphs

Alon Amit; Nathan Linial; Jiří Matoušek; Eyal Rozenman

Random lifts of graphs

Alon Amit^*, Nathan Linial, Jiří Matoušek, Eyal Rozenman

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouguet Bd and

Original language	English
Title of host publication	Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages	883-894
Number of pages	12
State	Published - 2001
Event	2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: 30 Apr 2001 → 1 May 2001

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2001 Operating Section Proceedings, American Gas Association
Country/Territory	United States
City	Dallas, TX
Period	30/04/01 → 1/05/01

Keywords

Algorithms
Theory

Cite this

@inproceedings{ed75129953e34e74b698db5fd08488fd,

title = "Random lifts of graphs",

abstract = "We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouguet Bd and",

keywords = "Algorithms, Theory",

author = "Alon Amit and Nathan Linial and Ji{\v r}{\'i} Matou{\v s}ek and Eyal Rozenman",

year = "2001",

language = "אנגלית",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "883--894",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "2001 Operating Section Proceedings, American Gas Association ; Conference date: 30-04-2001 Through 01-05-2001",

}

TY - GEN

T1 - Random lifts of graphs

AU - Amit, Alon

AU - Linial, Nathan

AU - Matoušek, Jiří

AU - Rozenman, Eyal

PY - 2001

Y1 - 2001

N2 - We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouguet Bd and

AB - We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouguet Bd and

KW - Algorithms

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=34748827952&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:34748827952

SN - 0898714907

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 883

EP - 894

BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

T2 - 2001 Operating Section Proceedings, American Gas Association

Y2 - 30 April 2001 through 1 May 2001

ER -

Random lifts of graphs

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this