skip to content
Fete of Combinatorics and Computer Science Preview this item
ClosePreview this item
Checking...

Fete of Combinatorics and Computer Science

Author: Gyula O H Katona; Alexander Schrijver; Tamás Szőnyi; Gábor Sági
Publisher: Berlin, Heidelberg : János Bolyai Mathematical Society and Springer-Verlag, 2010.
Series: Bolyai Society Mathematical Studies, 20.; Bolyai János Matematikai Társulat.; Bolyai Society mathematical studies
Edition/Format:   eBook : Document : EnglishView all editions and formats
Publication:Fete of combinatorics and computer science.
Database:WorldCat
Summary:

Based on the contributions to Laszlo Lovasz's 60th anniversary, Fete of Combinatorics and Computer Science provides a collection of articles on discrete mathematics and theoretical computer science.  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Gyula O H Katona; Alexander Schrijver; Tamás Szőnyi; Gábor Sági
ISBN: 9783642135804 3642135803
OCLC Number: 712216631
Description: 1 online resource (Online-Ressource.)
Contents: 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.
Series Title: Bolyai Society Mathematical Studies, 20.; Bolyai János Matematikai Társulat.; Bolyai Society mathematical studies
Responsibility: edited by Gyula O.H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/712216631>
library:oclcnum"712216631"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/712216631>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"
schema:name"Computational complexity."
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2010"
schema:exampleOfWork<http://worldcat.org/entity/work/id/1089539917>
schema:inLanguage"en"
schema:name"Fete of Combinatorics and Computer Science"
schema:publisher
schema:url
schema:url<http://dx.doi.org/10.1007/978-3-642-13580-4>
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.