跳至内容
Graph theory and combinatorics : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős 線上預覽
關閉線上預覽
正在查...

Graph theory and combinatorics : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős

作者: Paul Erdős; Béla Bollobás
出版商: London ; Orlando : Academic Press, 1984.
版本/格式:   圖書 : 會議刊物 : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在線上查詢

與資料的連結

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

類型/形式: Congresses
其他的實體格式: Online version:
Cambridge Combinatorial Conference (1983 : Trinity College)
Graph theory and combinatorics.
London ; Orlando : Academic Press, 1984
(OCoLC)623717042
提及的人: Paul Erdős
資料類型: 會議刊物, 網際網路資源
文件類型: 圖書, 網路資源
所有的作者/貢獻者: Paul Erdős; Béla Bollobás
ISBN: 012111760X 9780121117603
OCLC系統控制編碼: 11674659
注意: Held at Trinity College, Mar. 21-25, 1983.
描述: xvii, 328 p. : ill. ; 24 cm.
内容: On some problems in graph theory, combinatorial analysis and combinatorial number theory / Paul Erdös --
Large hypergraphs of diameter 1 / J-C. Bermond, J. Bond and J.F. Saclé --
On some Turan and Ramsey numbers for C₄ / A. Bialostocki and J. Schönheim --
The evolution of sparse graphs / Béla Bollobás --
Long cycles in sparse random graphs / Béla Bollobás, T.I. Fenner and A.M. Frieze --
Aspects of the random graph / Peter J. Cameron --
Partial edge-colourings of complete graphs or of graphs which are nearly complete / A.G. Chetwynd and A.J.W. Hilton --
Antichains of subsets of a finite set / David E. Daykin --
Extremal sets of subsets satisfying conditions induced by a graph / David E. Daykin and Peter Frankl --
Completion of sparse partial Latin squares / David E. Daykin and Roland Häggkvist --
The antivoter problem: random 2-colourings of graphs / Peter Donnelly and Dominic Welsh --
Schemes of graphs / Pierre Duchet --
Tree-multipartite graph Ramsey numbers / P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp --
A combinatorial proof of a continued fraction expansion theorem from the Ramanujan notebooks / I.P. Goulden and D.M. Jackson --
On intersections of longest cycles / Martin Grötschel --
Simplicial decompositions and triangulated graphs / R. Halin --
Independent cycles in graphs of given minimum degree / A.J. Harris --
Connected domination in graphs / S.T. Hedetniemi and Renu Laskar --
Shelling structures, convexity and a happy end / Bernhard Korete and László Lovász --
A correspondence between spanning trees and orientation in graphs / Michel Las Vergnas --
Equi-matchable graphs / M. Lesk, M.D. Plummer and W.R. Pulleyblank --
Unisecants of families of sets / Richard Rado --
Planar permutations defined by two intersecting Jordan curves / P. Rosentiehl --
A class of size Ramsey problems involving stars / J. Sheehan, R.J. Faudree and C.C. Rousseau --
Word Ramsey theorems / Imre Simon --
Unit distances in the Euclidean plane / J. Spencer, E. Szemerédi and W. Trotter, Jr. --
Connectivity in tournaments / Carsten Thomassen --
Planar enumeration / W.T. Tutte --
On the chromatic number of sparse random graphs / W. Fernandez de la Vega.
責任: edited by Béla Bollobás.
更多資訊:

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/11674659>
library:oclcnum"11674659"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/11674659>
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
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1984"
schema:exampleOfWork<http://worldcat.org/entity/work/id/836700324>
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"Graph theory and combinatorics : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős"@en
schema:numberOfPages"328"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.