close
1.

図書
図書
1. グラフ理論入門
B・ボロバッシュ著 ; 斎藤伸自, 西関隆夫共訳
出版情報: 東京 : 培風館, 1983.4  viii, 211p ; 22cm
所蔵情報: loading…
2.

図書
図書
2. Extremal graph theory
Béla Bollobás
出版情報: London ; New York : Academic Press, 1978  xx, 488 p. ; 24 cm
シリーズ名: L.M.S. monographs ; 11
所蔵情報: loading…
目次情報: 続きを見る
Preface
Basic Definitions
Connectivity / Chapter 1：
Elementary Properties / 1.：
Menger's Theorem and its Consequences / 2.：
The Structure of 2- and 3-Connected Graphs / 3.：
Minimally k-Connected Graphs / 4.：
Graphs with Given Maximal Local Connectivity / 5.：
Exercises, Problems and Conjectures / 6.：
Matching / Chapter 2：
Fundamental Matching Theorems
The Number of 1-Factors
f-Factors
Matching in Graphs with Restrictions on the Degrees
Coverings
Cycles / Chapter 3：
Graphs with Large Minimal Degree and Large Girth
Vertex Disjoint Cycles
Edge Disjoint Cycles
The Circumference
Graphs with Cycles of Given Lengths
The Diameter / Chapter 4：
Diameter, Maximal Degree and Size
Diameter and Connectivity
Graphs with Large Subgraphs of Small Diameter
Factors of Small Diameter
Colourings / Chapter 5：
General Colouring Theorems
Critical k-Chromatic Graphs
Colouring Graphs on Surfaces
Sparse Graphs of Large Chromatic Number
Perfect Graphs
Ramsey Type Theorems
Complete Subgraphs / 7.：
The Number of Complete Subgraphs
Complete Subgraphs of r-Partite Graphs
The Structure of Graphs
The Structure of Extremal Graphs without Forbidden Subgraphs
Independent Complete Subgraphs
Topological Subgraphs / Chapter 7：
Contractions
Topological Complete Subgraphs
Semi-Topological Subgraphs
Complexity and Packing / Chapter 8：
The Complexity of Graph Properties
Monotone Properties
The Main Packing Theorem
Packing Graphs of Small Size
Applications of Packing Results to Complexity
References
Index of Symbols
Index of Definitions
Preface
Basic Definitions
Connectivity / Chapter 1：
3.

図書
図書
3. Combinatorics, geometry, and probability : a tribute to Paul Erdős (: hbk)
edited by Bela Bollobas, Andrew Thomason
出版情報: Cambridge ; New York : Cambridge University Press, 1997  xxi, 562 p. ; 26cm
所蔵情報: loading…
目次情報: 続きを見る
Some unsolved problems / Paul Erdös1：
Menger's theorem for a countable source set / R. Aharoni ; R. Diestel2：
On extremal set partitions in Cartesian product spaces / R. Ahlswede ; N. Cai3：
Matchings in lattice graphs and Hamming graphs / M. Aigner ; R. Klimmek4：
Reconstructing a graph from its neighbourhood lists / E. Triesch5：
Threshold functions for H-factors / N. Alon ; R. Yuster6：
A rate for the Erdös-Turán law / A. D. Barbour ; S. Tavaré7：
Deterministic graph games and a probabilistic intuition / J. Beck8：
On oriented embedding of the binary tree into the hypercube / S. L. Bezrukov9：
Potential theory on distance-regular graphs / N. L. Biggs10：
On the length of the longest increasing subsequence in a random permutation / B. Bollobás ; S. Janson11：
On RichardsonÆs model on the hypercube / Y. Kohayakawa12：
Random permutations: some group-theoretic aspects / P. J. Cameron ; W. M. Kantor13：
Ramsey problems with bounded degree spread / G. Chen ; R. H. Schelp14：
Hamilton cycles in random regular digraphs / C. Cooper ; A. Frieze ; M. Molloy15：
On triangle contact graphs H. de Fraysseix / P. Ossona de Mendez ; P. Rosenstiehl16：
A combinatorial approach to complexity theory via ordinal hierarchies / W. A. Deuber ; W. Thumser17：
Lattice points of cut cones / M. Deza ; V. Grishukin18：
The growth of infinite graphs: boundedness and finite spreading / I. Leader19：
Amalgamated factorizations of complete graphs / J. K. Dugdale ; A. J. W. Hilton20：
Ramsey size linear graphs / R. J. Faudree ; C. C. Rousseau21：
Turán-Ramsey theorems and Kp independence numbers / A. Hajnal ; M. Simonovits ; V. T. Sós ; E. Szemerédi22：
Nearly equal distances in the plane Paul Erdös / E. Makai ; J. Pach23：
Clique partitions of chordal graphs Paul Erdös / E. T. Ordman ; Y. Zalcstein24：
On intersecting chains in Boolean algebras / Péter L. Erdös ; A. Seress ; L. A. Szekely25：
On the maximum number of triangles in wheel-free graphs / Z. Füredi ; M.X. Goemans ; D. J. Kleitman26：
Blocking sets in SQS(2v) M. Gionfriddo / S. Milici ; Zs. Tuza27：
(1,2)-factorisations of general Eulerian nearly regular graphs / R. Häggkvist ; A. Johansson28：
Oriented Hamilton cycles in digraphs / A. Thomason29：
Minimization problems for infinite n-connected graphs / R. Halin30：
On universal threshold graphs / P. L. Hammer ; A. K. Kelmans31：
Image partition regularity of matrices / N. Hindman32：
Extremal graph problems for graphs with a color-critical vertex / C. Hundack ; H. J. Prömel ; A. Steger33：
A note on W1-to-W1 functions / P. Komjáth34：
Topological cliques in graphs / J. Komlós35：
Local-global phenomena in graphs / N. Linial36：
On random generation of the symmetric group / T. Luczak ; L. Pyber37：
On vertex-edge-critically n-connected graphs / W. Mader38：
On a conjecture of Erdös and Cudakov / A. R. D. Mathias39：
A random recolouring method for graphs and hypergraphs / C. McDiarmid40：
Obstructions for the disk and the cylinder embedding extension problems / B. Mohar41：
A Ramsey-type theorem in the plane / J. Nesetril ; P. Valtr42：
The enumeration of self-avoiding walks and domains on a lattice / H. N. V. Temperley43：
An extension of Foster's network theorem / P. Tetali44：
Randomised approximation in the Tutte plane / D. J. A. Welsh45：
On crossing numbers, and some unsolved problems / H. S. Wilf46：
Some unsolved problems / Paul Erdös1：
Menger's theorem for a countable source set / R. Aharoni ; R. Diestel2：
On extremal set partitions in Cartesian product spaces / R. Ahlswede ; N. Cai3：
4.

図書
図書
4. Percolation
Béla Bollobás, Oliver Riordan
出版情報: Cambridge : Cambridge University Press, c2006  x, 323 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Basic concepts and results / 1：
Probabilistic tools / 2：
Bond percolation on Z[superscript 2] - the Harris-Kesten Theorem / 3：
The Russo-Seymour-Welsh method / 3.1：
Harris's Theorem / 3.2：
A sharp transition / 3.3：
Kesten's Theorem / 3.4：
Dependent percolation and exponential decay / 3.5：
Sub-exponential decay / 3.6：
Exponential decay and critical probabilities - theorems of Menshikov and Aizenman & Barsky / 4：
The van den Berg-Kesten inequality and percolation / 4.1：
Oriented site percolation / 4.2：
Almost exponential decay of the radius - Menshikov's Theorem / 4.3：
Exponential decay of the radius / 4.4：
Exponential decay of the volume - the Aizenman-Newman Theorem / 4.5：
Uniqueness of the infinite open cluster and critical probabilities / 5：
Uniqueness of the infinite open cluster - the Aizenman-Kesten-Newman Theorem / 5.1：
The Harris-Kesten Theorem revisited / 5.2：
Site percolation on the triangular and square lattices / 5.3：
Bond percolation on a lattice and its dual / 5.4：
The star-delta transformation / 5.5：
Estimating critical probabilities / 6：
The substitution method / 6.1：
Comparison with dependent percolation / 6.2：
Oriented percolation on Z[superscript 2] / 6.3：
Non-rigorous bounds / 6.4：
Conformal invariance - Smirnov's Theorem / 7：
Crossing probabilities and conformal invariance / 7.1：
Smirnov's Theorem / 7.2：
Critical exponents and Schramm-Loewner evolution / 7.3：
Continuum percolation / 8：
The Gilbert disc model / 8.1：
Finite random geometric graphs / 8.2：
Random Voronoi percolation / 8.3：
Bibliography
Index
List of notation
Preface
Basic concepts and results / 1：
Probabilistic tools / 2：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼