Fete of Combinatorics and Computer Science

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Katona, Gyula O. H. (Επιμελητής έκδοσης), Schrijver, Alexander (Επιμελητής έκδοσης), Szőnyi, Tamás (Επιμελητής έκδοσης), Sági, Gábor (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Bolyai Society Mathematical Studies, 20
• Θέματα: Mathematics.; Computer science > Mathematics.; Mathematical models.; Number theory.; Discrete mathematics.; Combinatorics.; Graph theory.; Discrete Mathematics.; Mathematical Modeling and Industrial Mathematics.; Graph Theory.; Number Theory.; Mathematics of Computing.

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

Πίνακας περιεχομένων:

• 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.