Pub. Date:
Springer Berlin Heidelberg
Fete of Combinatorics and Computer Science / Edition 1

Fete of Combinatorics and Computer Science / Edition 1


Current price is , Original price is $149.99. You
Select a Purchase Option (2010)
  • purchase options
    $119.99 $149.99 Save 20% Current price is $119.99, Original price is $149.99. You Save 20%.
  • purchase options

Product Details

ISBN-13: 9783642135798
Publisher: Springer Berlin Heidelberg
Publication date: 11/04/2010
Series: Bolyai Society Mathematical Studies , #20
Edition description: 2010
Pages: 361
Product dimensions: 6.70(w) x 9.30(h) x 1.00(d)

Table of Contents

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. Koshka, 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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews