Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] ISN:0000000109263673 | 1 hits
Person
ISNI: 
0000 0001 0926 3673
Name: 
Bollobás, B.
Bollobás, Béla
ボロバッシュ, B.
Dates: 
1943-
Creation class: 
Computer file
Language material
Text
Creation role: 
author
editor
redactor
writer of accompanying material
Related names: 
Aarhus Universitet
Baker, Alan (1939-...)
Cambridge University Press
Erdős, Paul (1913-1996)
Hajnal, András
Kozma, Robert
Littlewood, John Edensor (1885-1977)
London Mathematical Society
Meir, Amram
Miklós, Dezső
Riordan, Oliver
Thomason, Andrew
University Affiliation (see also from)
University of Cambridge
University of Cambridge Department of Pure Mathematics and Mathematical Statistics
Weinreich, David
金光, 滋
Titles: 
Advances in graph theory
art of mathematics coffee time in Memphis, The
Banach algebras and the theory of numerical ranges
Better bounds for Max Cut
Cambridge Combinatorial Conf., 1977. Advances in ... 1978 (a.e.)
Cambridge tracts in mathematics
Combinatorics : set systems, hypergraphs, families of vectors and combinatorial probability
Contemporary combinatorics
critical probability for random Voronoi percolation in the plane is 1/2, The
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 and combinatorics 1988 : proceedings
Graph theory proceedings of the Conference on Graph Theory, Cambridge
Gurafu riron nyumon.
hallószerv mikrochirurgiai anatomiája, A
Hamiltonian cycles in regular graphs
Handbook of large-scale random networks
interlace polynomial of a graph, The
Két független kört nem tartalmazó gráfokról
Linear analysis an introductory course
Littlewood's miscellany
Mathematician's miscellany
Measure graphs
Melanges. Erdos, Paul
On complete bipartite subgraphs contained in spanning tree complements
Percolation
Probabilistic combinatorics and its applications
probabilistic proof of an asymptotic formula for the number of labelled regular graphs, A
Random graphs
Ritoruddo no sugaku sukuranburu.
scaling window of the 2-SAT transition, The
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
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: 
Thesis (Ph.D.)--University of Cambridge, 1971
Wikipedia website, viewed 3 February 2015 (Béla Bollobás FRS (born 3 August 1943) is a Hungarian-born British mathematician who has worked in various areas of mathematics) http://en.wikipedia.org/wiki/B%C3%A9la_Bollob%C3%A1s
Sources: 
VIAF DNB LAC LC NDL NKC NSK NSZL NTA NUKAT SUDOC WKP
JNAM