000 03411nam a22005415i 4500
001 978-3-642-13580-4
003 DE-He213
005 20140220084539.0
007 cr nn 008mamaa
008 110213s2010 gw | s |||| 0|eng d
020 _a9783642135804
_9978-3-642-13580-4
024 7 _a10.1007/978-3-642-13580-4
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
100 1 _aKatona, Gyula O. H.
_eeditor.
245 1 0 _aFete of Combinatorics and Computer Science
_h[electronic resource] /
_cedited by Gyula O. H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _a365 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aBolyai Society Mathematical Studies,
_x1217-4696 ;
_v20
505 0 _aHigh 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.
520 _aDiscrete 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 many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume.
650 0 _aMathematics.
650 0 _aComputer science.
650 0 _aComputational complexity.
650 0 _aCombinatorics.
650 0 _aNumber theory.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aNumber Theory.
650 2 4 _aMathematics of Computing.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aSchrijver, Alexander.
_eeditor.
700 1 _aSzőnyi, Tamás.
_eeditor.
700 1 _aSági, Gábor.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642135798
830 0 _aBolyai Society Mathematical Studies,
_x1217-4696 ;
_v20
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-13580-4
912 _aZDB-2-SMA
999 _c112292
_d112292