Balister, Paul; Bollobás, Béla; Gunderson, Karen Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. (English) Zbl 1339.05268 Eur. J. Comb. 57, 85-93 (2016). MSC: 05C65 PDFBibTeX XMLCite \textit{P. Balister} et al., Eur. J. Comb. 57, 85--93 (2016; Zbl 1339.05268) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Krivelevich, Michael; Müller, Tobias; Walters, Mark Hamilton cycles in random geometric graphs. (English) Zbl 1222.05235 Ann. Appl. Probab. 21, No. 3, 1053-1072 (2011). MSC: 05C80 05C38 60D05 05C45 PDFBibTeX XMLCite \textit{J. Balogh} et al., Ann. Appl. Probab. 21, No. 3, 1053--1072 (2011; Zbl 1222.05235) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Simonovits, Miklós The fine structure of octahedron-free graphs. (English) Zbl 1239.05098 J. Comb. Theory, Ser. B 101, No. 2, 67-84 (2011). Reviewer: Hebert Pérez-Rosés (Castellon de la Plana) MSC: 05C35 05A20 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comb. Theory, Ser. B 101, No. 2, 67--84 (2011; Zbl 1239.05098) Full Text: DOI
Bollobás, Béla; Nikiforov, Vladimir Large joints in graphs. (English) Zbl 1202.05066 Eur. J. Comb. 32, No. 1, 33-44 (2011). Reviewer: Peter Horák (Tacoma) MSC: 05C35 05C69 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{V. Nikiforov}, Eur. J. Comb. 32, No. 1, 33--44 (2011; Zbl 1202.05066) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Morris, Robert Bootstrap percolation in high dimensions. (English) Zbl 1263.60082 Comb. Probab. Comput. 19, No. 5-6, 643-692 (2010). MSC: 60K35 05C80 60C05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 19, No. 5--6, 643--692 (2010; Zbl 1263.60082) Full Text: DOI arXiv
Bollobás, Béla; Borgs, Christian; Chayes, Jennifer; Riordan, Oliver Percolation on dense graph sequences. (English) Zbl 1190.60090 Ann. Probab. 38, No. 1, 150-183 (2010). Reviewer: Ove Frank (Stockholm) MSC: 60K35 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Ann. Probab. 38, No. 1, 150--183 (2010; Zbl 1190.60090) Full Text: DOI arXiv
Bollobás, Béla; Riordan, Oliver Clique percolation. (English) Zbl 1205.60165 Random Struct. Algorithms 35, No. 3, 294-322 (2009). Reviewer: Ove Frank (Stockholm) MSC: 60K35 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{O. Riordan}, Random Struct. Algorithms 35, No. 3, 294--322 (2009; Zbl 1205.60165) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Morris, Robert Majority bootstrap percolation on the hypercube. (English) Zbl 1198.60041 Comb. Probab. Comput. 18, No. 1-2, 17-51 (2009). Reviewer: Arnaud Le Ny (Orsay) MSC: 60K35 82B43 82C43 60C05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 18, No. 1--2, 17--51 (2009; Zbl 1198.60041) Full Text: DOI arXiv
Bollobás, Béla; Kostochka, Alexandr; Nakprasit, Kittikorn Packing \(d\)-degenerate graphs. (English) Zbl 1130.05046 J. Comb. Theory, Ser. B 98, No. 1, 85-94 (2008). Reviewer: Charles J. Colbourn (Tempe) MSC: 05C70 PDFBibTeX XMLCite \textit{B. Bollobás} et al., J. Comb. Theory, Ser. B 98, No. 1, 85--94 (2008; Zbl 1130.05046) Full Text: DOI
Bollobás, Béla; Scott, Alex On separating systems. (English) Zbl 1113.05097 Eur. J. Comb. 28, No. 4, 1068-1071 (2007). MSC: 05D05 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Scott}, Eur. J. Comb. 28, No. 4, 1068--1071 (2007; Zbl 1113.05097) Full Text: DOI
Bollobás, Béla; Scott, Alex Separating systems and oriented graphs of diameter two. (English) Zbl 1109.05103 J. Comb. Theory, Ser. B 97, No. 2, 193-203 (2007). MSC: 05D05 05C20 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Scott}, J. Comb. Theory, Ser. B 97, No. 2, 193--203 (2007; Zbl 1109.05103) Full Text: DOI
Balogh, József; Bollobás, Béla; Simonovits, Miklós The number of graphs without forbidden subgraphs. (English) Zbl 1044.05044 J. Comb. Theory, Ser. B 91, No. 1, 1-24 (2004). Reviewer: Dieter Rautenbach (Bonn) MSC: 05C35 05C30 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comb. Theory, Ser. B 91, No. 1, 1--24 (2004; Zbl 1044.05044) Full Text: DOI
Bollobás, Béla; Borgs, Christian; Chayes, Jennifer T.; Kim, Jeong Han; Wilson, David B. The scaling window of the 2-SAT transition. (English) Zbl 0979.68053 Random Struct. Algorithms 18, No. 3, 201-256 (2001). MSC: 68Q25 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 18, No. 3, 201--256 (2001; Zbl 0979.68053) Full Text: DOI arXiv
Balogh, József; Bollobás, Béla; Weinreich, David The speed of hereditary properties of graphs. (English) Zbl 1026.05062 J. Comb. Theory, Ser. B 79, No. 2, 131-156 (2000). MSC: 05C35 05C99 05C80 PDFBibTeX XMLCite \textit{J. Balogh} et al., J. Comb. Theory, Ser. B 79, No. 2, 131--156 (2000; Zbl 1026.05062) Full Text: DOI
Bollobás, Béla; Thomason, Andrew Highly linked graphs. (English) Zbl 0870.05044 Combinatorica 16, No. 3, 313-320 (1996). Reviewer: M.Hager (Leonberg) MSC: 05C40 05C38 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Thomason}, Combinatorica 16, No. 3, 313--320 (1996; Zbl 0870.05044) Full Text: DOI
Bollobás, Béla Degree multiplicities and independent sets in \(K_ 4\)-free graphs. (English) Zbl 0858.05056 Discrete Math. 158, No. 1-3, 27-35 (1996). Reviewer: B.Zelinka (Liberec) MSC: 05C35 PDFBibTeX XMLCite \textit{B. Bollobás}, Discrete Math. 158, No. 1--3, 27--35 (1996; Zbl 0858.05056) Full Text: DOI
Bollobás, Béla Turán-Ramsey problems. (English) Zbl 0857.05050 Discrete Math. 156, No. 1-3, 257-262 (1996). Reviewer: C.Jagger (Cambridge) MSC: 05C35 05C55 PDFBibTeX XMLCite \textit{B. Bollobás}, Discrete Math. 156, No. 1--3, 257--262 (1996; Zbl 0857.05050) Full Text: DOI
Bollobás, B.; Kohayakawa, Y.; Łuczak, T. Connectivity properties of random subgraphs of the cube. (English) Zbl 0827.05053 Random Struct. Algorithms 6, No. 2-3, 221-230 (1995). Reviewer: R.Vohra (Columbus / Ohio) MSC: 05C80 05C40 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 6, No. 2--3, 221--230 (1995; Zbl 0827.05053) Full Text: DOI
Bollobás, Béla; Kohayakawa, Y. An extension of the Erdős-Stone theorem. (English) Zbl 0813.05035 Combinatorica 14, No. 3, 279-286 (1994). Reviewer: P.Horák (Bratislava) MSC: 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{Y. Kohayakawa}, Combinatorica 14, No. 3, 279--286 (1994; Zbl 0813.05035) Full Text: DOI
Bollobás, Béla; Kohayakawa, Y.; Łuczak, T. The evolution of random subgraphs on the cube. (English) Zbl 0779.05045 Random Struct. Algorithms 3, No. 1, 55-90 (1992). Reviewer: W.Schlee (München) MSC: 05C80 60J80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 3, No. 1, 55--90 (1992; Zbl 0779.05045) Full Text: DOI
Bollobás, Béla Sorting in rounds. (English) Zbl 0667.68075 Discrete Math. 72, No. 1-3, 21-28 (1988). Reviewer: M.Garzon MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{B. Bollobás}, Discrete Math. 72, No. 1--3, 21--28 (1988; Zbl 0667.68075) Full Text: DOI
Bollobás, Béla; Fenner, T. I.; Frieze, A. M. An algorithm for finding Hamilton paths and cycles in random graphs. (English) Zbl 0638.05036 Combinatorica 7, 327-341 (1987). Reviewer: C.Thomassen MSC: 05C45 05C80 68R10 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Combinatorica 7, 327--341 (1987; Zbl 0638.05036) Full Text: DOI
Bollobás, Béla; Brightwell, Graham Graphs whose every transitive orientation contains almost every relation. (English) Zbl 0627.05037 Isr. J. Math. 59, 112-128 (1987). MSC: 05C80 06A05 06A06 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{G. Brightwell}, Isr. J. Math. 59, 112--128 (1987; Zbl 0627.05037) Full Text: DOI
Bollobas, Bela Almost all regular graphs are Hamiltonian. (English) Zbl 0513.05048 Eur. J. Comb. 4, 97-106 (1983). MSC: 05C80 05C45 PDFBibTeX XMLCite \textit{B. Bollobas}, Eur. J. Comb. 4, 97--106 (1983; Zbl 0513.05048) Full Text: DOI
Bollobás, Béla; Guy, Richard K. Equitable and proportional coloring of trees. (English) Zbl 0498.05027 J. Comb. Theory, Ser. B 34, 177-186 (1983). MSC: 05C15 05C05 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{R. K. Guy}, J. Comb. Theory, Ser. B 34, 177--186 (1983; Zbl 0498.05027) Full Text: DOI
Bollobas, Bela Long paths in sparse random graphs. (English) Zbl 0525.05051 Combinatorica 2, 223-228 (1982). MSC: 05C80 05C38 60C05 PDFBibTeX XMLCite \textit{B. Bollobas}, Combinatorica 2, 223--228 (1982; Zbl 0525.05051) Full Text: DOI
Bollobás, Béla; Eldridge, Stephen E. Packings of graphs and applications to computational complexity. (English) Zbl 0387.05020 J. Comb. Theory, Ser. B 25, 105-124 (1978). MSC: 05C99 05B40 68Q25 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{S. E. Eldridge}, J. Comb. Theory, Ser. B 25, 105--124 (1978; Zbl 0387.05020) Full Text: DOI
Bollobás, Béla; Erdős, Paul On a Ramsey-Turán type problem. (English) Zbl 0337.05134 J. Comb. Theory, Ser. B 21, 166-168 (1976). Reviewer: B.Andrásfai MSC: 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{P. Erdős}, J. Comb. Theory, Ser. B 21, 166--168 (1976; Zbl 0337.05134) Full Text: DOI