Fete of Combinatorics and Computer Science

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and m...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Katona, Gyula O.H (Editor ), Schrijver, Alexander (Editor ), Szönyi, Tamás (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Bolyai Society Mathematical Studies, 20
Temas:
Discrete mathematics.
Mathematical models.
Graph theory.
Number theory.
Computer science > Mathematics.
Discrete Mathematics.
Mathematical Modeling and Industrial Mathematics.
Graph Theory.
Number Theory.
Mathematics of Computing.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • High Degree Graphs Contain Large-Star Factors
  • Iterated Triangle Partitions
  • PageRank and Random Walks on Graphs
  • Solution of Peter Winkler's Pizza Problem*†
  • Tight Bounds for Embedding Bounded Degree Trees
  • Betti Numbers are Testable*
  • Rigid and Globally Rigid Graphs with Pinned Vertices
  • Noise Sensitivity and Chaos in Social Choice Theory
  • Coloring Uniform Hypergraphs with Small Edge Degrees
  • Extremal Graphs and Multigraphs with Two Weighted Colours
  • Regularity Lemmas for Graphs
  • Edge Coloring Models as Singular Vertex Coloring Models
  • List Total Weighting of Graphs
  • Open Problems.

Ejemplares similares