Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] (ISNI Number (ISN:)) 0000000109263673 | 1 hits
Person
ISNI: 
0000 0001 0926 3673
Name: 
Bollobás
Bollobás, B.
Bollobás, Béla
ボロバッシュ, B
Dates: 
1943-
Creation class: 
cre
Language material
Text
Creation role: 
author
contributor
editor
redactor
writer of accompanying material
Related names: 
Aarhus Universitet
Baker, Alan (1939- ))
Erdős, Paul (1913-1996))
Hajnal, A.
Hajnal, András
Kozma, Robert (1958- ))
London Mathematical Society
Meir, Amram
Miklós, Dezsö
Riordan, Oliver
Thomason, Andrew
University Affiliation (see also from)
Weinreich, David
金光, 滋
Titles: 
Advances in graph theory
art of mathematics, The : coffee time in Memphis
Better bounds for Max Cut
Cambridge Combinatorial Conf., 1977. Advances in ... 1978 (a.e.)
Combinatorics and probability : celebrating Béla Bollabás's 60th birthday
Combinatorics, geometry and probability : a tribute to Paul Erdős
Combinatorics : set systems, hypergraphs, families of vectors and combinatorial probability
Contemporary combinatorics
degree sequence of a scale-free random graph process, The
Degree sequences of Random graphs
External graphs without large forbidden subgraphs
extremal function for the achromatic number, An
Extremal graph theory with emphasis on probabilistic methods
Gráfelméleti szélső értékekre vonatkozó problémákról
Graph theory an introd. course
Graph theory : an introduction course
Graph theory : an introductory course
Graph theory and combinatorics 1988 : 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, [Trinity college, Cambridge, 21-25 March 1983]
Graph theory : proceedings of the Conference on Graph Theory, Cambridge
Gurafu riron nyūmon
hallószerv mikrochirurgiai anatomiája, A
Hamiltonian cycles in regular graphs
Handbook of large-scale random networks
Két független kört nem tartalmazó gráfokról
Linear analysis : an introductory course
Littlewood's miscellany
Martingales, isoperimetric inequalities and random graphs
Mathematician's miscellany
Measure graphs
Miscellany
Modern graph theory
On complete bipartite subgraphs contained in spanning tree complements
Percolation
Probabilistic combinatorics and its applications [lecture notes prepared for the American mathematical society short course "Probabilistic combinatorics and its applications", held in San Francisco, California, January 14-15 1991]
probabilistic proof of an asymptotic formula for the number of labelled regular graphs, A
Random graphs
Ritorūddo no sūgaku sukuranburu
sík lefedése egybevágó konvex sokszögekkel az egyenletes ötszögparkettázsok 2. közl., A
size of connected hypergraphs with prescribed covering number, The
state space definition of the Homfly invariant, A
Surveys in combinatorics : proceedings of the 7th British Combinatorial Conference
Teoriâ na grafite
Threshold functions for small subgraphs.
travelling salesman problem in the k-dimensional unit cube, The
tribute to Paul Erdős, A
グラフ理論入門
リトルウッドの数学スクランブル
Notes: 
Sources: 
VIAF BNF DNB LAC LC NDL NKC NSK NSZL NTA NUKAT SUDOC WKP
TEL