He also had private tutors, not to teach him school subjects but to teach him other activities. These tutors, who had held important positions in Hungary before the Communists took over, had been forced out of their jobs and had taken up teaching. They included a former general, a count, a baroness and a former judge. He also worked on packings, coverings, and tilings for his doctorate, publishing papers such as Filling the plane with congruent convex hexagons without overlapping Donald Coxeter reviewed this paper:- The problem of filling and covering the Euclidean plane with congruent but not necessarily "equivalent" polygons was discussed by Kepler , Hilbert The author obtains some significant restrictions on the possible kinds of convex hexagons that can serve as a tile.
|Published (Last):||15 March 2015|
|PDF File Size:||19.7 Mb|
|ePub File Size:||11.85 Mb|
|Price:||Free* [*Free Regsitration Required]|
An old approach to the giant component problem. Theory Ser. Riordan Disjoint induced subgraphs of the same order and size.
European J. Kittipassorn, B. Scott Monotone cellular automata in a random environment. Smith and A. Uzzell A coding problem for pairs of subsets. Furedi, I. Kantor, G. Katona, and I. Leader The time of bootstrap percolation with dense initial sets for all thresholds. Uzzell Partial shadows of set systems. Eccles Transference for the Erdos-Ko-Rado theorem.
Forum Math. Balogh, and B. Narayanan Bootstrap percolation on Galton-Watson trees. Gunderson, C. Holmgren, S. Janson and M. Przykucki Interference percolation. Balister Random union-closed families. Balister, Z. Furedi and J. Thompson The time of bootstrap percolation with dense initial sets.
Holmgren, P. Lackmann and D. Schleicher The phase transition in random graphs. Riordan Metric dimension for random graphs. Mitsche and P. Riordan Union-closed families of sets. Balla and T. Eccles Repeated degrees in random uniform hypergraphs. SIAM J. Discrete Math. Paul, J. Lehel and M. Morayne Cover-decomposition and polychromatic numbers.
Pritchard, T. Rothvoss and A. Scott Cops and robbers in a random graph. B , no. Kun and I. Leader Walks and paths in trees. Graph Theory 70 , no. Balogh; T. Bohman; and Y. Zhao The sharp threshold for bootstrap percolation in all dimensions. Balogh, H. Duminil-Copin and R. Morris Projections, entropy and sumsets. Combinatorica 32 , no. Balister Monotone graph limits and quasimonotone graphs. Internet Math. Janson and O. Riordan Lion and mancan both win?
Israel J. Leader and M. Linear algebra and bootstrap percolation. A , no. Balogh, R. Morris and O. Riordan Graph bootstrap percolation. Random Structures Algorithms 41 , no. Balogh and R. Morris Degree powers in graphs: the Erdos-Stone theorem. Nikiforov Critical probabilities of 1-independent percolation models. Balister Asymptotic normality of the size of the giant component via a random walk. Riordan Asymptotic normality of the size of the giant component in a random hypergraph. Riordan A simple branching process approach to the phase transition in Gn,p.
Riordan The structure of almost all graphs in a hereditary property. B , Alon, J. Balogh, and R. Morris The fine structure of octahedron-free graphs. Balogh and M. Simonovits Sparse random graphs with clustering. Random Structures Algorithms. Riordan Sparse graphs: metrics and random models. Random Structures Algorithms 39 , Riordan Shadows of ordered graphs. A , Brightwell and R. Morris On covering by translates of a set. Random Structures Algorithms 38 , Balogh and O.
Riordan Large joints in graphs. Nikiforov Intersections of graphs. Scott Hamilton cycles in random geometric graphs. Balogh, M. Krivelevich, T. Walters Daisies and other Turan problems. Leader and C. Malvenuto Cover-decomposition and polychromatic numbers. The number of graphs with large forbidden subgraphs. European Journal of Combinatorics 31, , — Nikiforov The cut matric, random graphs, and branching processes.
Statistical Physics , , — Riordan Random majority percolation.
Subscribe to RSS