skip to content
Fete of combinatorics and computer science Preview this item
ClosePreview this item
Checking...

Fete of combinatorics and computer science

Author: G Katona; A Schrijver; T Szőnyi
Publisher: Berlin ; Heidelberg ; New York : Springer, 2010.
Series: Bolyai Society mathematical studies, 20.
Edition/Format:   eBook : Document : EnglishView all editions and formats
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

Find a copy in the library

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

Details

Genre/Form: Electronic books
Kongress
Additional Physical Format: Print version:
Fete of combinatorics and computer science.
Berlin ; Heidelberg ; New York : Springer, 2010
(OCoLC)646114230
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: G Katona; A Schrijver; T Szőnyi
ISBN: 9783642135804 3642135803 9789639453128 9639453129
OCLC Number: 710812072
Description: 1 online resource (365 p.) : ill.
Contents: Cover --
Table of Contents --
Preface --
High Degree Graphs Contain Large-Star Factors --
1. Introduction --
2. Regular Graphs --
3. The Proof Of The Main Result --
4. Concluding Remarks And Open Problems --
References --
Iterated Triangle Partitions --
1. Introduction --
2. Subdividing By Bisectors --
2.1. Subdividing Into Three Daughters --
2.2. Dividing Into Six Triangles --
3. Subdividing By Medians --
3.1. Analytic Approach --
3.2. Hyperbolic Approach --
4. Subdividing By The Gergonne Point --
5. Subdividing By The Lemoine Point --
6. Concluding Remarks --
References --
Pagerank And Random Walks On Graphs --
1. Introduction --
2. Laplacian, The Green'S Function And Pagerank --
3. Pagerank, The Hitting Time And The Effective Resistance In Electrical Networks --
4. Several Matrix-Forest Theorems --
5. Pagerank And Other Invariants In Terms Of Rooted Spanning Forests --
6. Using The Generalized Hitting Time To Find Sparse Cuts --
7. Using Pagerank To Estimate The Effective Resistance --
References --
Solution Of Peter Winkler'S Pizza Problem*! --
1. Introduction --
2. The Lower Bound --
2.1. Preliminaries --
2.2. Minimal Triples --
2.3. An Auxiliary One-Jump Strategy --
2.4. A Two-Jump Strategy --
2.5. Proof of the Lower Bound --
3. The Upper Bound --
4. Fixed Number Of Slices --
5. Cuttings Into 15 And 21 Slices --
6. One-Jump Strategies --
6.1. Lower Bound --
6.2. Upper Bound --
7. Algorithms --
7.1. Linear Algorithm --
7.2. Optimal Strategies --
References --
Tight Bounds For Embedding Bounded Degree Trees --
1. Introduction --
2. The Non-Extremal Case --
2.1. Some Tools for the Proofs in the Non-Extremal Cases --
2.2 . The First Non-Extremal Case: T Has a Broad Subtree --
2.3. The Second Non-Extremal Case: T Has a Long Subtree --
3. The Extremal Case --
3.1. The First Extremal Case --
3.2. The Second Extremal Case --
4. Lower Bound For The Minimum Degree In G --
4.1. The First Extremal Case --
4.2. The Second Extremal Case --
References --
Betti Numbers Are Testable* --
1. Introduction --
2. The Convergence Of Simplicial Complexes --
3. Betti Numbers And Combinatorial Laplacians --
4. Weak Convergence Of Probability Measures --
5. Spectral Convergence --
6. The Proof Of Theorem 1 --
References --
Rigid And Globally Rigid Graphs With Pinned Vertices --
1. Introduction --
2. Rigid Frameworks With Pinned Vertices --
3. Rigid Graphs With Pinned Vertices --
4. The Two-Dimensional Rigidity Matroid --
5. Optimal Families Of Tracks And Smallest Pinning Sets --
6. The Network Localization Problem --
7. Graphs With A Connected Rigidity Matroid --
7.1. M-Connected Graphs With Pinned Vertices --
8. Low Cost Anchor Sets In Uniquely Localizable Networks --
References --
Noise Sensitivity And Chaos In Social Choice Theory --
1. Introduction --
2. Proofs Of The Equivalence Theorems --
2.1. A Coupling Argument --
2.2. An Elementary Harmonic Analysis Argument --
2.3. Individual Power --
3. Multi-Level Majority --
T$
Series Title: Bolyai Society mathematical studies, 20.
Responsibility: Gyula O.H. Katona, Alexander Schrijver, Tamás Szőnyi (eds.).
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/710812072>
library:oclcnum"710812072"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/710812072>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/872460>
rdf:typeschema:Intangible
schema:name"Combinatorial analysis."@en
schema:name"Computer science--Mathematics"@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"2010"
schema:description"Cover -- Table of Contents -- Preface -- High Degree Graphs Contain Large-Star Factors -- 1. Introduction -- 2. Regular Graphs -- 3. The Proof Of The Main Result -- 4. Concluding Remarks And Open Problems -- References -- Iterated Triangle Partitions -- 1. Introduction -- 2. Subdividing By Bisectors -- 2.1. Subdividing Into Three Daughters -- 2.2. Dividing Into Six Triangles -- 3. Subdividing By Medians -- 3.1. Analytic Approach -- 3.2. Hyperbolic Approach -- 4. Subdividing By The Gergonne Point -- 5. Subdividing By The Lemoine Point -- 6. Concluding Remarks -- References -- Pagerank And Random Walks On Graphs -- 1. Introduction -- 2. Laplacian, The Green'S Function And Pagerank -- 3. Pagerank, The Hitting Time And The Effective Resistance In Electrical Networks -- 4. Several Matrix-Forest Theorems -- 5. Pagerank And Other Invariants In Terms Of Rooted Spanning Forests -- 6. Using The Generalized Hitting Time To Find Sparse Cuts -- 7. Using Pagerank To Estimate The Effective Resistance -- References -- Solution Of Peter Winkler'S Pizza Problem*! -- 1. Introduction -- 2. The Lower Bound -- 2.1. Preliminaries -- 2.2. Minimal Triples -- 2.3. An Auxiliary One-Jump Strategy -- 2.4. A Two-Jump Strategy -- 2.5. Proof of the Lower Bound -- 3. The Upper Bound -- 4. Fixed Number Of Slices -- 5. Cuttings Into 15 And 21 Slices -- 6. One-Jump Strategies -- 6.1. Lower Bound -- 6.2. Upper Bound -- 7. Algorithms -- 7.1. Linear Algorithm -- 7.2. Optimal Strategies -- References -- Tight Bounds For Embedding Bounded Degree Trees -- 1. Introduction -- 2. The Non-Extremal Case -- 2.1. Some Tools for the Proofs in the Non-Extremal Cases -- 2.2 . The First Non-Extremal Case: T Has a Broad Subtree -- 2.3. The Second Non-Extremal Case: T Has a Long Subtree -- 3. The Extremal Case -- 3.1. The First Extremal Case -- 3.2. The Second Extremal Case -- 4. Lower Bound For The Minimum Degree In G -- 4.1. The First Extremal Case -- 4.2. The Second Extremal Case -- References -- Betti Numbers Are Testable* -- 1. Introduction -- 2. The Convergence Of Simplicial Complexes -- 3. Betti Numbers And Combinatorial Laplacians -- 4. Weak Convergence Of Probability Measures -- 5. Spectral Convergence -- 6. The Proof Of Theorem 1 -- References -- Rigid And Globally Rigid Graphs With Pinned Vertices -- 1. Introduction -- 2. Rigid Frameworks With Pinned Vertices -- 3. Rigid Graphs With Pinned Vertices -- 4. The Two-Dimensional Rigidity Matroid -- 5. Optimal Families Of Tracks And Smallest Pinning Sets -- 6. The Network Localization Problem -- 7. Graphs With A Connected Rigidity Matroid -- 7.1. M-Connected Graphs With Pinned Vertices -- 8. Low Cost Anchor Sets In Uniquely Localizable Networks -- References -- Noise Sensitivity And Chaos In Social Choice Theory -- 1. Introduction -- 2. Proofs Of The Equivalence Theorems -- 2.1. A Coupling Argument -- 2.2. An Elementary Harmonic Analysis Argument -- 2.3. Individual Power -- 3. Multi-Level Majority -- T$"@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1089539917>
schema:genre"Electronic books."@en
schema:genre"Kongress."@en
schema:inLanguage"en"
schema:name"Fete of combinatorics and computer science"@en
schema:publisher
schema:url<http://www.myilibrary.com?id=307626&ref=toc>
schema:url<http://www.myilibrary.com?id=307626>
schema:url<http://site.ebrary.com/id/10448262>
schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374163>
schema:url
schema:url<http://dx.doi.org/10.1007/978-3-642-13580-4>
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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