You are here

Fete of Combinatorics and Computer Science

Publisher: 
Springer
Number of Pages: 
365
Price: 
149.00
ISBN: 
9783642135798
Date Received: 
Thursday, January 6, 2011
Reviewable: 
No
Include In BLL Rating: 
No
Reviewer Email Address: 
Gyula O. H. Katona, Alexander Schrijver, and Tamás Szőnyi, editors
Series: 
Bolyai Society Mathematical Studies 20
Publication Date: 
2010
Format: 
Hardcover
Category: 
Festschrift

Preface.- N. Alon and N. Wormald: High Degree Graphs contain Large-Star Factors.- S. Butler and R. Graham: Iterated Triangle Partitions.- F. Chung and W. Zhao: PageRank and Random Walks on Graphics.- J. Cibulka, J. Kyncl, V. Meszaros, R. Stolar and P. Valtr: Solution of Peter Winkler's Pizza Problem.- B. Czaba, I.Levitt, J. Nagy-György and E. Szemerédi: Tight Bounds for Embedding Bounded Degree Trees.- G. Elek: Betti Numbers are Testable.- T. Jordán: Rigid and Globally Rigid Graphs with Pinned Vertices. .- G. Kalai: Noise Sensitivity and Chaos in Social Choice Theory.- A. Kostochka, M. Kumbhat and V. Födl: Coloring Uniform Hypergraphs with Small Edge Degrees. .- E. Marchant and A. Thomason: Extremal Graphs and Multigraphs with two Weighted Colours.- V. Rödl and M. Schacht: Regularity Lemmas for Graphs.- B. Szegedy: Edge Colorings Models as Singular Vertex Coloring Models.- T.-L. Wong, D. Yang and X. Zhu: List Total Weighting of Graphs. .- Open Problems.

Publish Book: 
Modify Date: 
Thursday, January 6, 2011

Dummy View - NOT TO BE DELETED