Del 20 i serien Bolyai Society Mathematical Studies

Fete of Combinatorics and Computer Science

Häftad, Engelska, 2016

AvGyula O.H. Katona,Alexander Schrijver,Tamás Szönyi

1 409 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines.

Produktinformation

Utgivningsdatum2016-10-25
Mått170 x 244 x 20 mm
Vikt635 g
FormatHäftad
SpråkEngelska
SerieBolyai Society Mathematical Studies
Antal sidor361
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662506424

Tillhör följande kategorier

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.