Huang, Xueyi; Das, Kinkar Chandra; Zhu, Shunlai Toughness and normalized Laplacian eigenvalues of graphs. (English) Zbl 07529367 Appl. Math. Comput. 425, Article ID 127075, 7 p. (2022). MSC: 05C50 05C42 PDF BibTeX XML Cite \textit{X. Huang} et al., Appl. Math. Comput. 425, Article ID 127075, 7 p. (2022; Zbl 07529367) Full Text: DOI OpenURL
Dai, Guowei Remarks on component factors in graphs. (English) Zbl 07523416 RAIRO, Oper. Res. 56, No. 2, 721-730 (2022). MSC: 05C70 05C38 05C07 05C35 05C10 PDF BibTeX XML Cite \textit{G. Dai}, RAIRO, Oper. Res. 56, No. 2, 721--730 (2022; Zbl 07523416) Full Text: DOI OpenURL
Razborov, Alexander An extremal problem motivated by triangle-free strongly regular graphs. (English) Zbl 07514794 J. Comb. Theory, Ser. B 155, 52-82 (2022). MSC: 05C35 03C13 05A16 05C42 05E30 PDF BibTeX XML Cite \textit{A. Razborov}, J. Comb. Theory, Ser. B 155, 52--82 (2022; Zbl 07514794) Full Text: DOI OpenURL
Kaufmann, Michael; Ueckerdt, Torsten The density of fan-planar graphs. (English) Zbl 07503032 Electron. J. Comb. 29, No. 1, Research Paper P1.29, 25 p. (2022). MSC: 05C42 05C62 05C10 68R10 PDF BibTeX XML Cite \textit{M. Kaufmann} and \textit{T. Ueckerdt}, Electron. J. Comb. 29, No. 1, Research Paper P1.29, 25 p. (2022; Zbl 07503032) Full Text: DOI OpenURL
Kim, Jinha; Kim, Minki; Kwon, O-joung Rainbow independent sets on dense graph classes. (English) Zbl 07497776 Discrete Appl. Math. 312, 45-51 (2022). MSC: 05C69 05C75 05C15 05C70 05C42 05C75 05C83 PDF BibTeX XML Cite \textit{J. Kim} et al., Discrete Appl. Math. 312, 45--51 (2022; Zbl 07497776) Full Text: DOI OpenURL
Adler, Isolde; Benediktsson, Bjarki Geir; Macpherson, Dugald Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. (English) Zbl 07497775 Discrete Appl. Math. 312, 29-44 (2022). MSC: 03C45 68Q25 05C42 05C85 05C12 PDF BibTeX XML Cite \textit{I. Adler} et al., Discrete Appl. Math. 312, 29--44 (2022; Zbl 07497775) Full Text: DOI OpenURL
Garbe, Frederik; Hladký, Jan; Lee, Joonkyung Two remarks on graph norms. (English) Zbl 07495507 Discrete Comput. Geom. 67, No. 3, 919-929 (2022). MSC: 05C99 05C42 05E05 PDF BibTeX XML Cite \textit{F. Garbe} et al., Discrete Comput. Geom. 67, No. 3, 919--929 (2022; Zbl 07495507) Full Text: DOI OpenURL
Király, Csaba; Mihálykó, András Sparse graphs and an augmentation problem. (English) Zbl 07495415 Math. Program. 192, No. 1-2 (B), 119-148 (2022). MSC: 05C42 05B35 68R10 PDF BibTeX XML Cite \textit{C. Király} and \textit{A. Mihálykó}, Math. Program. 192, No. 1--2 (B), 119--148 (2022; Zbl 07495415) Full Text: DOI OpenURL
Han, Jike; Matsubara, Seishiro; Moriguchi, Shuji; Kaliske, Michael; Terada, Kenjiro Crack phase-field model equipped with plastic driving force and degrading fracture toughness for ductile fracture simulation. (English) Zbl 07492663 Comput. Mech. 69, No. 1, 151-175 (2022). MSC: 74-XX PDF BibTeX XML Cite \textit{J. Han} et al., Comput. Mech. 69, No. 1, 151--175 (2022; Zbl 07492663) Full Text: DOI OpenURL
Zhou, Si-zhong; Sun, Zhi-ren; Liu, Hong-xia On \(P_{\geq 3}\)-factor deleted graphs. (English) Zbl 07490427 Acta Math. Appl. Sin., Engl. Ser. 38, No. 1, 178-186 (2022). MSC: 05C70 05C38 05C40 PDF BibTeX XML Cite \textit{S.-z. Zhou} et al., Acta Math. Appl. Sin., Engl. Ser. 38, No. 1, 178--186 (2022; Zbl 07490427) Full Text: DOI OpenURL
Zaker, Manouchehr More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs. (English) Zbl 07481757 Bull. Korean Math. Soc. 59, No. 1, 119-139 (2022). Reviewer: Juanjo Rué Perna (Barcelona) MSC: 05C78 05C38 05C15 05C45 05C85 05C76 PDF BibTeX XML Cite \textit{M. Zaker}, Bull. Korean Math. Soc. 59, No. 1, 119--139 (2022; Zbl 07481757) Full Text: DOI arXiv OpenURL
Alt, Johannes; Ducatez, Raphaël; Knowles, Antti The completely delocalized region of the Erdős-Rényi graph. (English) Zbl 1483.05151 Electron. Commun. Probab. 27, 1-9 (2022). MSC: 05C80 05C42 15B52 60B20 PDF BibTeX XML Cite \textit{J. Alt} et al., Electron. Commun. Probab. 27, 1--9 (2022; Zbl 1483.05151) Full Text: DOI arXiv OpenURL
Backhausz, Ágnes; Móri, Tamás F. A random graph of moderate density. (English) Zbl 1483.05152 Electron. Commun. Probab. 27, 1-12 (2022). MSC: 05C80 05C42 05C07 PDF BibTeX XML Cite \textit{Á. Backhausz} and \textit{T. F. Móri}, Electron. Commun. Probab. 27, 1--12 (2022; Zbl 1483.05152) Full Text: DOI OpenURL
Shan, Songling An Ore-type condition for Hamiltonicity in tough graphs. (English) Zbl 07467798 Electron. J. Comb. 29, No. 1, Research Paper P1.5, 12 p. (2022). Reviewer: Linda Lesniak (Kalamazoo) MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{S. Shan}, Electron. J. Comb. 29, No. 1, Research Paper P1.5, 12 p. (2022; Zbl 07467798) Full Text: DOI arXiv OpenURL
Naserasr, Reza; Pham, Lan Anh; Wang, Zhouningxin Density of \(C_{-4}\)-critical signed graphs. (English) Zbl 1481.05086 J. Comb. Theory, Ser. B 153, 81-104 (2022). MSC: 05C42 05C22 PDF BibTeX XML Cite \textit{R. Naserasr} et al., J. Comb. Theory, Ser. B 153, 81--104 (2022; Zbl 1481.05086) Full Text: DOI arXiv OpenURL
Aigner-Horev, Elad; Danon, Oran; Hefetz, Dan; Letzter, Shoham Small rainbow cliques in randomly perturbed dense graphs. (English) Zbl 1480.05126 Eur. J. Comb. 101, Article ID 103452, 34 p. (2022). MSC: 05D10 05C15 05C42 60C05 PDF BibTeX XML Cite \textit{E. Aigner-Horev} et al., Eur. J. Comb. 101, Article ID 103452, 34 p. (2022; Zbl 1480.05126) Full Text: DOI arXiv OpenURL
Dudek, Andrzej; English, Sean; Frieze, Alan; MacRury, Calum; Prałat, Paweł Localization game for random graphs. (English) Zbl 1480.05092 Discrete Appl. Math. 309, 202-214 (2022). MSC: 05C57 05C80 05C42 91A43 91A24 PDF BibTeX XML Cite \textit{A. Dudek} et al., Discrete Appl. Math. 309, 202--214 (2022; Zbl 1480.05092) Full Text: DOI arXiv OpenURL
Zheng, Wei; Broersma, Hajo; Wang, Ligong Toughness, forbidden subgraphs, and Hamilton-connected graphs. (English) Zbl 1479.05183 Discuss. Math., Graph Theory 42, No. 1, 187-196 (2022). MSC: 05C45 05C38 05C42 PDF BibTeX XML Cite \textit{W. Zheng} et al., Discuss. Math., Graph Theory 42, No. 1, 187--196 (2022; Zbl 1479.05183) Full Text: DOI OpenURL
Kunszenti-Kovács, Dávid; Lovász, László; Szegedy, Balázs Multigraph limits, unbounded kernels, and Banach space decorated graphs. (English) Zbl 1479.05342 J. Funct. Anal. 282, No. 2, Article ID 109284, 44 p. (2022). MSC: 05C99 05C42 05C80 PDF BibTeX XML Cite \textit{D. Kunszenti-Kovács} et al., J. Funct. Anal. 282, No. 2, Article ID 109284, 44 p. (2022; Zbl 1479.05342) Full Text: DOI arXiv OpenURL
Keevash, Peter; Staden, Katherine The generalised Oberwolfach problem. (English) Zbl 1478.05116 J. Comb. Theory, Ser. B 152, 281-318 (2022). MSC: 05C70 05C38 05C42 PDF BibTeX XML Cite \textit{P. Keevash} and \textit{K. Staden}, J. Comb. Theory, Ser. B 152, 281--318 (2022; Zbl 1478.05116) Full Text: DOI arXiv OpenURL
Jing, Yifan; Kostochka, Alexandr; Ma, Fuhong; Xu, Jingwei Defective DP-colorings of sparse simple graphs. (English) Zbl 1476.05053 Discrete Math. 345, No. 1, Article ID 112637, 14 p. (2022). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{Y. Jing} et al., Discrete Math. 345, No. 1, Article ID 112637, 14 p. (2022; Zbl 1476.05053) Full Text: DOI arXiv OpenURL
Ferland, Kevin K. A survey of maximum toughness. (English) Zbl 07511550 Ars Comb. 154, 317-326 (2021). MSC: 05C40 05C35 PDF BibTeX XML Cite \textit{K. K. Ferland}, Ars Comb. 154, 317--326 (2021; Zbl 07511550) OpenURL
Den Hollander, Frank Complex networks: structure and functionality. (English) Zbl 07500573 Inahama, Yuzuru (ed.) et al., Stochastic analysis, random fields and integrable probability – Fukuoka 2019. Proceedings of the 12th Mathematical Society of Japan, Seasonal Institute (MSJ-SI), Kyushu University, Japan, 31 July – 9 August 2019. Tokyo: Mathematical Society of Japan. Adv. Stud. Pure Math. 87, 137-155 (2021). MSC: 05C82 05C80 05C81 05C50 05C42 60J10 60C05 PDF BibTeX XML Cite \textit{F. Den Hollander}, Adv. Stud. Pure Math. 87, 137--155 (2021; Zbl 07500573) Full Text: DOI OpenURL
Zheng, Wei; Broersma, Hajo; Wang, Ligong On Hamiltonicity of 1-tough triangle-free graphs. (English) Zbl 1482.05177 Electron. J. Graph Theory Appl. 9, No. 2, 433-441 (2021). MSC: 05C38 05C42 05C45 PDF BibTeX XML Cite \textit{W. Zheng} et al., Electron. J. Graph Theory Appl. 9, No. 2, 433--441 (2021; Zbl 1482.05177) Full Text: DOI OpenURL
Björklund, Michael; Fish, Alexander; Parkinson, James Patterns in sets of positive density in trees and affine buildings. (English) Zbl 1482.05221 Groups Geom. Dyn. 15, No. 4, 1267-1295 (2021). MSC: 05C55 05D10 05C12 05C42 PDF BibTeX XML Cite \textit{M. Björklund} et al., Groups Geom. Dyn. 15, No. 4, 1267--1295 (2021; Zbl 1482.05221) Full Text: DOI arXiv OpenURL
Borgs, Christian; Chayes, Jennifer T.; Dhara, Souvik; Sen, Subhabrata Limits of sparse configuration models and beyond: graphexes and multigraphexes. (English) Zbl 1481.05138 Ann. Probab. 49, No. 6, 2830-2873 (2021). MSC: 05C80 05C42 60C05 60G09 60G55 60G57 PDF BibTeX XML Cite \textit{C. Borgs} et al., Ann. Probab. 49, No. 6, 2830--2873 (2021; Zbl 1481.05138) Full Text: DOI arXiv OpenURL
Girão, António; Granet, Bertille; Kühn, Daniela; Osthus, Deryk Path and cycle decompositions of dense graphs. (English) Zbl 1479.05300 J. Lond. Math. Soc., II. Ser. 104, No. 3, 1085-1134 (2021). MSC: 05C70 05C38 05D40 05C42 PDF BibTeX XML Cite \textit{A. Girão} et al., J. Lond. Math. Soc., II. Ser. 104, No. 3, 1085--1134 (2021; Zbl 1479.05300) Full Text: DOI arXiv OpenURL
Mendoza-Granada, Fabricio; Villagra, Marcos A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021). MSC: 68R10 05C42 05C50 62H30 68Q11 68W15 PDF BibTeX XML Cite \textit{F. Mendoza-Granada} and \textit{M. Villagra}, AIRO Springer Ser. 5, 403--413 (2021; Zbl 1483.68259) Full Text: DOI arXiv OpenURL
Hua, Hongbo Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs. (English) Zbl 1475.05097 J. Appl. Math. Comput. 66, No. 1-2, 809-821 (2021). MSC: 05C38 05C75 PDF BibTeX XML Cite \textit{H. Hua}, J. Appl. Math. Comput. 66, No. 1--2, 809--821 (2021; Zbl 1475.05097) Full Text: DOI OpenURL
Petit, Julien; Lambiotte, Renaud; Carletti, Timoteo Random walks on dense graphs and graphons. (English) Zbl 1477.05175 SIAM J. Appl. Math. 81, No. 6, 2323-2345 (2021). MSC: 05C81 05C42 05C22 34G10 45K05 47D06 PDF BibTeX XML Cite \textit{J. Petit} et al., SIAM J. Appl. Math. 81, No. 6, 2323--2345 (2021; Zbl 1477.05175) Full Text: DOI arXiv OpenURL
Chang, Yu-lin; Jing, Fei; Wang, Guang-hui; Wu, Ji-chang Total-coloring of sparse graphs with maximum degree 6. (English) Zbl 1482.05098 Acta Math. Appl. Sin., Engl. Ser. 37, No. 4, 738-746 (2021). Reviewer: Vinayak Joshi (Pune) MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{Y.-l. Chang} et al., Acta Math. Appl. Sin., Engl. Ser. 37, No. 4, 738--746 (2021; Zbl 1482.05098) Full Text: DOI OpenURL
Zelenskiy, Oleksiy; Darmosiuk, Valentyna; Nalivayko, Illia A note on possible density and diameter of counterexamples to the Seymour’s second neighborhood conjecture. (English) Zbl 1476.05099 Opusc. Math. 41, No. 4, 601-605 (2021). MSC: 05C42 05C12 05C20 PDF BibTeX XML Cite \textit{O. Zelenskiy} et al., Opusc. Math. 41, No. 4, 601--605 (2021; Zbl 1476.05099) Full Text: DOI OpenURL
Bonchi, Francesco; García-Soriano, David; Miyauchi, Atsushi; Tsourakakis, Charalampos E. Finding densest \(k\)-connected subgraphs. (English) Zbl 1476.05096 Discrete Appl. Math. 305, 34-47 (2021). MSC: 05C40 05C42 68W25 68Q25 PDF BibTeX XML Cite \textit{F. Bonchi} et al., Discrete Appl. Math. 305, 34--47 (2021; Zbl 1476.05096) Full Text: DOI arXiv OpenURL
Dembo, Amir; Lubetzky, Eyal; Zhang, Yumeng Empirical spectral distributions of sparse random graphs. (English) Zbl 1473.05282 Vares, Maria Eulália (ed.) et al., In and out of equilibrium 3: celebrating Vladas Sidoravicius. Cham: Birkhäuser. Prog. Probab. 77, 319-345 (2021). Reviewer: Yilun Shang (Newcastle) MSC: 05C80 05C42 05C50 15B52 60B20 PDF BibTeX XML Cite \textit{A. Dembo} et al., Prog. Probab. 77, 319--345 (2021; Zbl 1473.05282) Full Text: DOI arXiv OpenURL
Mütze, Torsten; Nummenpalo, Jerri; Walczak, Bartosz Sparse Kneser graphs are Hamiltonian. (English) Zbl 1470.05096 J. Lond. Math. Soc., II. Ser. 103, No. 4, 1253-1275 (2021). MSC: 05C45 05C42 94B25 PDF BibTeX XML Cite \textit{T. Mütze} et al., J. Lond. Math. Soc., II. Ser. 103, No. 4, 1253--1275 (2021; Zbl 1470.05096) Full Text: DOI OpenURL
Kao, Louis; Weng, Chih-wen The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs. (English) Zbl 1470.05095 Graphs Comb. 37, No. 3, 933-943 (2021). MSC: 05C45 05C70 05C76 05C38 05C42 PDF BibTeX XML Cite \textit{L. Kao} and \textit{C.-w. Weng}, Graphs Comb. 37, No. 3, 933--943 (2021; Zbl 1470.05095) Full Text: DOI arXiv OpenURL
Zheng, Wei; Broersma, Hajo; Wang, Ligong Toughness, forbidden subgraphs and pancyclicity. (English) Zbl 1470.05092 Graphs Comb. 37, No. 3, 839-866 (2021). MSC: 05C38 05C42 05C45 05C60 PDF BibTeX XML Cite \textit{W. Zheng} et al., Graphs Comb. 37, No. 3, 839--866 (2021; Zbl 1470.05092) Full Text: DOI OpenURL
Naik, Cian; Caron, François; Rousseau, Judith Sparse networks with core-periphery structure. (English) Zbl 1470.05149 Electron. J. Stat. 15, No. 1, 1814-1868 (2021). MSC: 05C80 05C42 62F15 60G55 PDF BibTeX XML Cite \textit{C. Naik} et al., Electron. J. Stat. 15, No. 1, 1814--1868 (2021; Zbl 1470.05149) Full Text: DOI arXiv OpenURL
Pinto, Bruno Q.; Ribeiro, Celso C.; Riveaux, José A.; Rosseti, Isabel A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. (English) Zbl 1469.05135 RAIRO, Oper. Res. 55, Suppl., S741-S763 (2021). MSC: 05C69 05C42 05C85 68T20 90C27 90C59 PDF BibTeX XML Cite \textit{B. Q. Pinto} et al., RAIRO, Oper. Res. 55, S741--S763 (2021; Zbl 1469.05135) Full Text: DOI OpenURL
Novotná, Jana; Okrasa, Karolina; Pilipczuk, Michał; Rzążewski, Paweł; van Leeuwen, Erik Jan; Walczak, Bartosz Subexponential-time algorithms for finding large induced sparse subgraphs. (English) Zbl 1469.05159 Algorithmica 83, No. 8, 2634-2650 (2021). MSC: 05C85 05C42 05C60 68Q25 PDF BibTeX XML Cite \textit{J. Novotná} et al., Algorithmica 83, No. 8, 2634--2650 (2021; Zbl 1469.05159) Full Text: DOI arXiv OpenURL
Coste, Simon The spectral gap of sparse random digraphs. (English. French summary) Zbl 1468.05093 Ann. Inst. Henri Poincaré, Probab. Stat. 57, No. 2, 644-684 (2021). MSC: 05C20 05C50 05C42 05C80 47A11 60B20 15B52 60J10 PDF BibTeX XML Cite \textit{S. Coste}, Ann. Inst. Henri Poincaré, Probab. Stat. 57, No. 2, 644--684 (2021; Zbl 1468.05093) Full Text: DOI arXiv OpenURL
Yuster, Raphael Dominant tournament families. (English) Zbl 1468.05102 J. Comb. 12, No. 2, 269-282 (2021). MSC: 05C20 05C35 05C42 05C75 PDF BibTeX XML Cite \textit{R. Yuster}, J. Comb. 12, No. 2, 269--282 (2021; Zbl 1468.05102) Full Text: DOI arXiv OpenURL
Markström, Klas; Thomassen, Carsten Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices. (English) Zbl 1468.05139 J. Comb. 12, No. 2, 235-245 (2021). MSC: 05C42 05C65 05C35 05C30 PDF BibTeX XML Cite \textit{K. Markström} and \textit{C. Thomassen}, J. Comb. 12, No. 2, 235--245 (2021; Zbl 1468.05139) Full Text: DOI arXiv OpenURL
Aigner-Horev, Elad; Hefetz, Dan Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs. (English) Zbl 1468.05067 SIAM J. Discrete Math. 35, No. 3, 1569-1577 (2021). MSC: 05C15 05C80 05C42 05C38 05C45 PDF BibTeX XML Cite \textit{E. Aigner-Horev} and \textit{D. Hefetz}, SIAM J. Discrete Math. 35, No. 3, 1569--1577 (2021; Zbl 1468.05067) Full Text: DOI arXiv OpenURL
Chen, Pingge; Liang, Jinhua; Peng, Yuejian The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension. (English) Zbl 1468.05194 Discuss. Math., Graph Theory 41, No. 4, 905-921 (2021). MSC: 05C65 05C42 PDF BibTeX XML Cite \textit{P. Chen} et al., Discuss. Math., Graph Theory 41, No. 4, 905--921 (2021; Zbl 1468.05194) Full Text: DOI OpenURL
Zhou, Sizhong; Sun, Zhiren; Liu, Hongxia Isolated toughness and path-factor uniform graphs. (English) Zbl 1468.05243 RAIRO, Oper. Res. 55, No. 3, 1279-1290 (2021). MSC: 05C70 05C38 90B10 PDF BibTeX XML Cite \textit{S. Zhou} et al., RAIRO, Oper. Res. 55, No. 3, 1279--1290 (2021; Zbl 1468.05243) Full Text: DOI OpenURL
Park, Davin; Ostuni, Anthony; Hayes, Nathan; Banerjee, Amartya; Wakhare, Tanay; Wong, Wiseley; Cioabă, Sebastian The toughness of Kneser graphs. (English) Zbl 1467.05142 Discrete Math. 344, No. 9, Article ID 112484, 15 p. (2021). MSC: 05C40 05C45 05C50 PDF BibTeX XML Cite \textit{D. Park} et al., Discrete Math. 344, No. 9, Article ID 112484, 15 p. (2021; Zbl 1467.05142) Full Text: DOI arXiv OpenURL
Pach, János; Rubin, Natan; Tardos, Gábor Planar point sets determine many pairwise crossing segments. (English) Zbl 1467.05050 Adv. Math. 386, Article ID 107779, 21 p. (2021). MSC: 05C10 05C42 52C10 05D10 PDF BibTeX XML Cite \textit{J. Pach} et al., Adv. Math. 386, Article ID 107779, 21 p. (2021; Zbl 1467.05050) Full Text: DOI OpenURL
Coste, Simon; Salez, Justin Emergence of extended states at zero in the spectrum of sparse random graphs. (English) Zbl 1467.05240 Ann. Probab. 49, No. 4, 2012-2030 (2021). MSC: 05C80 05C50 05C42 47A10 60B20 PDF BibTeX XML Cite \textit{S. Coste} and \textit{J. Salez}, Ann. Probab. 49, No. 4, 2012--2030 (2021; Zbl 1467.05240) Full Text: DOI arXiv OpenURL
Bhattacharya, Bhaswar B.; Bhattacharya, Sohom; Ganguly, Shirshendu Spectral edge in sparse random graphs: upper and lower tail large deviations. (English) Zbl 1467.05237 Ann. Probab. 49, No. 4, 1847-1885 (2021). MSC: 05C80 05C42 05C50 05C35 15A18 60B20 60F10 PDF BibTeX XML Cite \textit{B. B. Bhattacharya} et al., Ann. Probab. 49, No. 4, 1847--1885 (2021; Zbl 1467.05237) Full Text: DOI arXiv OpenURL
Alfke, Dominik; Stoll, Martin Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs. (English) Zbl 1473.68133 Data Min. Knowl. Discov. 35, No. 4, 1318-1341 (2021). MSC: 68T05 05C42 05C50 05C65 68R10 94A12 PDF BibTeX XML Cite \textit{D. Alfke} and \textit{M. Stoll}, Data Min. Knowl. Discov. 35, No. 4, 1318--1341 (2021; Zbl 1473.68133) Full Text: DOI arXiv OpenURL
Lee, Jong-Min; Hwang, Jin-Ha; Kim, Yun-Jae; Kim, Jin-Weon Predicting ductile fracture of cracked pipes using small punch test data. (English) Zbl 1481.74687 Eur. J. Mech., A, Solids 87, Article ID 104211, 12 p. (2021). MSC: 74R20 74S05 PDF BibTeX XML Cite \textit{J.-M. Lee} et al., Eur. J. Mech., A, Solids 87, Article ID 104211, 12 p. (2021; Zbl 1481.74687) Full Text: DOI OpenURL
Greenhill, Catherine; Isaev, Mikhail; Mckay, Brendan D. Subgraph counts for dense random graphs with specified degrees. (English) Zbl 1466.05197 Comb. Probab. Comput. 30, No. 3, 460-497 (2021). MSC: 05C80 05C42 05C07 05C30 05C05 05A05 PDF BibTeX XML Cite \textit{C. Greenhill} et al., Comb. Probab. Comput. 30, No. 3, 460--497 (2021; Zbl 1466.05197) Full Text: DOI arXiv OpenURL
Aigner-Horev, Elad; Levy, Gil Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. (English) Zbl 1466.05142 Comb. Probab. Comput. 30, No. 3, 412-443 (2021). MSC: 05C65 05C80 05D05 05C35 05C42 05C45 PDF BibTeX XML Cite \textit{E. Aigner-Horev} and \textit{G. Levy}, Comb. Probab. Comput. 30, No. 3, 412--443 (2021; Zbl 1466.05142) Full Text: DOI arXiv OpenURL
Chen, Guantao; Hao, Yanli The conjunction of the linear arboricity conjecture and Lovász’s path partition theorem. (English) Zbl 1466.05177 Discrete Math. 344, No. 8, Article ID 112434, 7 p. (2021). MSC: 05C70 05C38 05C42 05C80 PDF BibTeX XML Cite \textit{G. Chen} and \textit{Y. Hao}, Discrete Math. 344, No. 8, Article ID 112434, 7 p. (2021; Zbl 1466.05177) Full Text: DOI OpenURL
MacKeigan, Kyle Independent coverings and orthogonal colourings. (English) Zbl 1466.05186 Discrete Math. 344, No. 8, Article ID 112431, 7 p. (2021). MSC: 05C70 05C15 05C42 05D15 PDF BibTeX XML Cite \textit{K. MacKeigan}, Discrete Math. 344, No. 8, Article ID 112431, 7 p. (2021; Zbl 1466.05186) Full Text: DOI arXiv OpenURL
Alesandroni, Guillermo The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs. (English) Zbl 1466.05143 Discrete Math. 344, No. 7, Article ID 112401, 7 p. (2021). MSC: 05C65 05C42 05C15 PDF BibTeX XML Cite \textit{G. Alesandroni}, Discrete Math. 344, No. 7, Article ID 112401, 7 p. (2021; Zbl 1466.05143) Full Text: DOI arXiv OpenURL
Basak, Anirban; Rudelson, Mark Sharp transition of the invertibility of the adjacency matrices of sparse random graphs. (English) Zbl 1468.05275 Probab. Theory Relat. Fields 180, No. 1-2, 233-308 (2021). MSC: 05C80 05C42 60B20 46B09 PDF BibTeX XML Cite \textit{A. Basak} and \textit{M. Rudelson}, Probab. Theory Relat. Fields 180, No. 1--2, 233--308 (2021; Zbl 1468.05275) Full Text: DOI arXiv OpenURL
Frieze, Alan M. The effect of adding randomly weighted edges. (English) Zbl 1465.05159 SIAM J. Discrete Math. 35, No. 2, 1182-1200 (2021). MSC: 05C80 05C42 60C05 PDF BibTeX XML Cite \textit{A. M. Frieze}, SIAM J. Discrete Math. 35, No. 2, 1182--1200 (2021; Zbl 1465.05159) Full Text: DOI arXiv OpenURL
Anastos, Michael; Lamaison, Ander; Steiner, Raphael; Szabó, Tibor Majority colorings of sparse digraphs. (English) Zbl 1465.05057 Electron. J. Comb. 28, No. 2, Research Paper P2.31, 17 p. (2021). MSC: 05C15 05C20 05C42 05C75 PDF BibTeX XML Cite \textit{M. Anastos} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.31, 17 p. (2021; Zbl 1465.05057) Full Text: DOI arXiv OpenURL
Hahn-Klimroth, Max; Maesaka, Giulia S.; Mogge, Yannick; Mohr, Samuel; Parczyk, Olaf Random perturbation of sparse graphs. (English) Zbl 1465.05091 Electron. J. Comb. 28, No. 2, Research Paper P2.26, 12 p. (2021). MSC: 05C42 05C35 05C80 PDF BibTeX XML Cite \textit{M. Hahn-Klimroth} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.26, 12 p. (2021; Zbl 1465.05091) Full Text: DOI arXiv OpenURL
Zhou, Jiang; Bu, Changjiang; Lai, Hong-Jian Edge-disjoint spanning trees and forests of graphs. (English) Zbl 1465.05086 Discrete Appl. Math. 299, 74-81 (2021). MSC: 05C30 05C05 05C70 PDF BibTeX XML Cite \textit{J. Zhou} et al., Discrete Appl. Math. 299, 74--81 (2021; Zbl 1465.05086) Full Text: DOI OpenURL
Freschi, Andrea; Hyde, Joseph; Lada, Joanna; Treglown, Andrew A note on color-bias Hamilton cycles in dense graphs. (English) Zbl 1465.05093 SIAM J. Discrete Math. 35, No. 2, 970-975 (2021). MSC: 05C45 05C15 05C55 05C35 05C42 PDF BibTeX XML Cite \textit{A. Freschi} et al., SIAM J. Discrete Math. 35, No. 2, 970--975 (2021; Zbl 1465.05093) Full Text: DOI arXiv OpenURL
Gu, Xiaofeng A proof of Brouwer’s toughness conjecture. (English) Zbl 1465.05102 SIAM J. Discrete Math. 35, No. 2, 948-952 (2021). MSC: 05C50 05C80 05C40 PDF BibTeX XML Cite \textit{X. Gu}, SIAM J. Discrete Math. 35, No. 2, 948--952 (2021; Zbl 1465.05102) Full Text: DOI arXiv OpenURL
Jordán, Tibor A note on generic rigidity of graphs in higher dimension. (English) Zbl 1462.05259 Discrete Appl. Math. 297, 97-101 (2021). MSC: 05C62 52C25 05C35 05C42 PDF BibTeX XML Cite \textit{T. Jordán}, Discrete Appl. Math. 297, 97--101 (2021; Zbl 1462.05259) Full Text: DOI OpenURL
McCarty, Rose Dense induced subgraphs of dense bipartite graphs. (English) Zbl 1462.05258 SIAM J. Discrete Math. 35, No. 2, 661-667 (2021). MSC: 05C60 05C38 05C42 PDF BibTeX XML Cite \textit{R. McCarty}, SIAM J. Discrete Math. 35, No. 2, 661--667 (2021; Zbl 1462.05258) Full Text: DOI arXiv OpenURL
Noy, Marc; Rasendrahasina, Vonjy; Ravelomanana, Vlady; Rué, Juanjo Cycles of given lengths in unicyclic components in sparse random graphs. (English) Zbl 1461.05188 Adv. Appl. Math. 125, Article ID 102162, 15 p. (2021). MSC: 05C80 05C38 05C12 05C42 05C10 05A16 PDF BibTeX XML Cite \textit{M. Noy} et al., Adv. Appl. Math. 125, Article ID 102162, 15 p. (2021; Zbl 1461.05188) Full Text: DOI arXiv OpenURL
Briański, Marcin; Micek, Piotr; Pilipczuk, Michał; Seweryn, Michał T. Erdös-Hajnal properties for powers of sparse graphs. (English) Zbl 1460.05103 SIAM J. Discrete Math. 35, No. 1, 447-464 (2021). MSC: 05C42 05C15 05C83 PDF BibTeX XML Cite \textit{M. Briański} et al., SIAM J. Discrete Math. 35, No. 1, 447--464 (2021; Zbl 1460.05103) Full Text: DOI arXiv OpenURL
Litvak, Alexander Evgen’evich; Lytova, Anna; Tikhomirov, Konstantin; Tomczak-Jaegermann, Nicole; Youssef, Pierre Circular law for sparse random regular digraphs. (English) Zbl 1460.05174 J. Eur. Math. Soc. (JEMS) 23, No. 2, 467-501 (2021). MSC: 05C80 05C42 15B52 46B06 46B09 60C05 60B20 PDF BibTeX XML Cite \textit{A. E. Litvak} et al., J. Eur. Math. Soc. (JEMS) 23, No. 2, 467--501 (2021; Zbl 1460.05174) Full Text: DOI arXiv OpenURL
Bal, Deepak; Schudrich, Ely On the size Ramsey number of all cycles versus a path. (English) Zbl 1460.05123 Discrete Math. 344, No. 5, Article ID 112322, 10 p. (2021). MSC: 05C55 05D10 05C42 PDF BibTeX XML Cite \textit{D. Bal} and \textit{E. Schudrich}, Discrete Math. 344, No. 5, Article ID 112322, 10 p. (2021; Zbl 1460.05123) Full Text: DOI arXiv OpenURL
Yatauro, Michael Stability theorems for graph vulnerability parameters. (English) Zbl 1459.05322 Graphs Comb. 37, No. 1, 221-239 (2021). MSC: 05C99 05C45 05C07 05C42 PDF BibTeX XML Cite \textit{M. Yatauro}, Graphs Comb. 37, No. 1, 221--239 (2021; Zbl 1459.05322) Full Text: DOI OpenURL
Kamcev, Nina; Liebenau, Anita; Wood, David R.; Yepremyan, Liana The size Ramsey number of graphs with bounded treewidth. (English) Zbl 1459.05201 SIAM J. Discrete Math. 35, No. 1, 281-293 (2021). MSC: 05C55 05D10 05C05 05C42 PDF BibTeX XML Cite \textit{N. Kamcev} et al., SIAM J. Discrete Math. 35, No. 1, 281--293 (2021; Zbl 1459.05201) Full Text: DOI arXiv OpenURL
Choi, Ilkyoo; Park, Boram On star 5-colorings of sparse graphs. (English) Zbl 1459.05076 Discrete Appl. Math. 294, 233-252 (2021). MSC: 05C15 05C42 05C07 PDF BibTeX XML Cite \textit{I. Choi} and \textit{B. Park}, Discrete Appl. Math. 294, 233--252 (2021; Zbl 1459.05076) Full Text: DOI arXiv OpenURL
Katona, Gyula Y.; Kovács, István; Varga, Kitti The complexity of recognizing minimally tough graphs. (English) Zbl 1464.05217 Discrete Appl. Math. 294, 55-84 (2021). MSC: 05C40 68Q17 PDF BibTeX XML Cite \textit{G. Y. Katona} et al., Discrete Appl. Math. 294, 55--84 (2021; Zbl 1464.05217) Full Text: DOI arXiv OpenURL
Duan, Cunxiang; Wang, Ligong Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph. (English) Zbl 1456.05101 Bull. Iran. Math. Soc. 47, No. 1, 185-196 (2021). MSC: 05C50 05C40 05C42 05C05 PDF BibTeX XML Cite \textit{C. Duan} and \textit{L. Wang}, Bull. Iran. Math. Soc. 47, No. 1, 185--196 (2021; Zbl 1456.05101) Full Text: DOI OpenURL
Anastos, Michael; Frieze, Alan A scaling limit for the length of the longest cycle in a sparse random graph. (English) Zbl 1459.05059 J. Comb. Theory, Ser. B 148, 184-208 (2021). MSC: 05C12 05C38 05C80 60C05 05C42 PDF BibTeX XML Cite \textit{M. Anastos} and \textit{A. Frieze}, J. Comb. Theory, Ser. B 148, 184--208 (2021; Zbl 1459.05059) Full Text: DOI arXiv OpenURL
Lazarev, Denis O.; Kuzyurin, Nikolay N. Dense subgraphs of power-law random graphs. (English) Zbl 1459.05145 Mosc. J. Comb. Number Theory 10, No. 1, 1-11 (2021). MSC: 05C42 05C80 05C69 05C35 PDF BibTeX XML Cite \textit{D. O. Lazarev} and \textit{N. N. Kuzyurin}, Mosc. J. Comb. Number Theory 10, No. 1, 1--11 (2021; Zbl 1459.05145) Full Text: DOI OpenURL
Daynes, Stephen; Lifton, Joseph; Lu, Wen Feng; Wei, Jun; Feih, Stefanie Fracture toughness characteristics of additively manufactured Ti-6Al-4V lattices. (English) Zbl 1479.74114 Eur. J. Mech., A, Solids 86, Article ID 104170, 14 p. (2021). MSC: 74R20 74S05 74K99 74-05 PDF BibTeX XML Cite \textit{S. Daynes} et al., Eur. J. Mech., A, Solids 86, Article ID 104170, 14 p. (2021; Zbl 1479.74114) Full Text: DOI OpenURL
Askarinejad, Sina; Martínez-Pañeda, Emilio; Cuesta, I. Ivan; Fleck, Norman Mode II fracture of an MMA adhesive layer: theory versus experiment. (English) Zbl 1478.74072 Eur. J. Mech., A, Solids 86, Article ID 104133, 10 p. (2021). MSC: 74R10 74E30 74S05 74-05 PDF BibTeX XML Cite \textit{S. Askarinejad} et al., Eur. J. Mech., A, Solids 86, Article ID 104133, 10 p. (2021; Zbl 1478.74072) Full Text: DOI arXiv OpenURL
Shan, Songling Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs. (English) Zbl 1458.05134 Electron. J. Comb. 28, No. 1, Research Paper P1.36, 16 p. (2021). MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{S. Shan}, Electron. J. Comb. 28, No. 1, Research Paper P1.36, 16 p. (2021; Zbl 1458.05134) Full Text: DOI arXiv OpenURL
Jing, Yifan; Kostochka, Alexandr; Ma, Fuhong; Sittitrai, Pongpat; Xu, Jingwei Defective DP-colorings of sparse multigraphs. (English) Zbl 1458.05071 Eur. J. Comb. 93, Article ID 103267, 21 p. (2021). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{Y. Jing} et al., Eur. J. Comb. 93, Article ID 103267, 21 p. (2021; Zbl 1458.05071) Full Text: DOI arXiv OpenURL
Gu, Xiaofeng Toughness in pseudo-random graphs. (English) Zbl 1458.05239 Eur. J. Comb. 92, Article ID 103255, 11 p. (2021). MSC: 05C80 PDF BibTeX XML Cite \textit{X. Gu}, Eur. J. Comb. 92, Article ID 103255, 11 p. (2021; Zbl 1458.05239) Full Text: DOI OpenURL
Kostochka, Alexandr; Xu, Jingwei On 2-defective DP-colorings of sparse graphs. (English) Zbl 1458.05074 Eur. J. Comb. 91, Article ID 103217, 20 p. (2021). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{A. Kostochka} and \textit{J. Xu}, Eur. J. Comb. 91, Article ID 103217, 20 p. (2021; Zbl 1458.05074) Full Text: DOI OpenURL
van den Heuvel, Jan; Kierstead, H. A. Uniform orderings for generalized coloring numbers. (English) Zbl 1458.05085 Eur. J. Comb. 91, Article ID 103214, 13 p. (2021). MSC: 05C15 05C12 05C75 05C42 PDF BibTeX XML Cite \textit{J. van den Heuvel} and \textit{H. A. Kierstead}, Eur. J. Comb. 91, Article ID 103214, 13 p. (2021; Zbl 1458.05085) Full Text: DOI arXiv OpenURL
Askarinejad, S.; Thouless, M. D.; Fleck, N. A. Failure of a pre-cracked epoxy sandwich layer in shear. (English) Zbl 1476.74130 Eur. J. Mech., A, Solids 85, Article ID 104134, 10 p. (2021). MSC: 74R10 74G70 74K30 74-05 PDF BibTeX XML Cite \textit{S. Askarinejad} et al., Eur. J. Mech., A, Solids 85, Article ID 104134, 10 p. (2021; Zbl 1476.74130) Full Text: DOI OpenURL
Feghali, Carl Reconfiguring colorings of graphs with bounded maximum average degree. (English) Zbl 1458.05066 J. Comb. Theory, Ser. B 147, 133-138 (2021). MSC: 05C15 05C07 05C42 PDF BibTeX XML Cite \textit{C. Feghali}, J. Comb. Theory, Ser. B 147, 133--138 (2021; Zbl 1458.05066) Full Text: DOI arXiv OpenURL
Kapadia, Rohan; Norin, Sergey; Qian, Yingjie Asymptotic density of graphs excluding disconnected minors. (English) Zbl 1457.05060 J. Comb. Theory, Ser. B 146, 151-175 (2021). MSC: 05C42 05C83 05C38 PDF BibTeX XML Cite \textit{R. Kapadia} et al., J. Comb. Theory, Ser. B 146, 151--175 (2021; Zbl 1457.05060) Full Text: DOI arXiv OpenURL
Kahl, Nathan Graph vulnerability parameters, compression, and threshold graphs. (English) Zbl 1466.05189 Discrete Appl. Math. 292, 108-116 (2021). MSC: 05C76 05C69 PDF BibTeX XML Cite \textit{N. Kahl}, Discrete Appl. Math. 292, 108--116 (2021; Zbl 1466.05189) Full Text: DOI OpenURL
Aldosari, Haya S.; Greenhill, Catherine The average number of spanning hypertrees in sparse uniform hypergraphs. (English) Zbl 1455.05029 Discrete Math. 344, No. 1, Article ID 112192, 6 p. (2021). MSC: 05C30 05C65 05C05 05C80 05C42 05A16 PDF BibTeX XML Cite \textit{H. S. Aldosari} and \textit{C. Greenhill}, Discrete Math. 344, No. 1, Article ID 112192, 6 p. (2021; Zbl 1455.05029) Full Text: DOI arXiv OpenURL
Diestel, Reinhard; Oum, Sang-il Tangle-tree duality in abstract separation systems. (English) Zbl 1471.05087 Adv. Math. 377, Article ID 107470, 25 p. (2021). MSC: 05C70 05C42 05C40 05C83 05C05 PDF BibTeX XML Cite \textit{R. Diestel} and \textit{S.-i. Oum}, Adv. Math. 377, Article ID 107470, 25 p. (2021; Zbl 1471.05087) Full Text: DOI arXiv OpenURL
Zhang, Peng; Liu, Zhendong Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph. (English) Zbl 1464.68302 Theor. Comput. Sci. 849, 173-183 (2021). MSC: 68R10 05C42 68W25 90C27 PDF BibTeX XML Cite \textit{P. Zhang} and \textit{Z. Liu}, Theor. Comput. Sci. 849, 173--183 (2021; Zbl 1464.68302) Full Text: DOI OpenURL
Kamaldinov, Dmitry; Skorkin, Arkadiy; Zhukovskii, Maksim Maximum sparse induced subgraphs of the binomial random graph with given number of edges. (English) Zbl 1454.05111 Discrete Math. 344, No. 2, Article ID 112205, 14 p. (2021). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C42 05C35 05C05 PDF BibTeX XML Cite \textit{D. Kamaldinov} et al., Discrete Math. 344, No. 2, Article ID 112205, 14 p. (2021; Zbl 1454.05111) Full Text: DOI arXiv OpenURL
Frankl, Peter; Huang, Hao; Rödl, Vojtěch On local Turán problems. (English) Zbl 1448.05148 J. Comb. Theory, Ser. A 177, Article ID 105329, 9 p. (2021). MSC: 05C65 05C42 PDF BibTeX XML Cite \textit{P. Frankl} et al., J. Comb. Theory, Ser. A 177, Article ID 105329, 9 p. (2021; Zbl 1448.05148) Full Text: DOI arXiv OpenURL
Chudnovsky, Maria; Fox, Jacob; Scott, Alex; Seymour, Paul; Spirkl, Sophie Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. (English) Zbl 07500693 J. Graph Theory 95, No. 3, 315-340 (2020). MSC: 05C42 05C55 05D10 PDF BibTeX XML Cite \textit{M. Chudnovsky} et al., J. Graph Theory 95, No. 3, 315--340 (2020; Zbl 07500693) Full Text: DOI OpenURL
Shan, Songling Hamiltonian cycles in 3-tough \(2K_2\)-free graphs. (English) Zbl 07500663 J. Graph Theory 94, No. 3, 349-363 (2020). Reviewer: Hang Lau (Montréal) MSC: 05C45 PDF BibTeX XML Cite \textit{S. Shan}, J. Graph Theory 94, No. 3, 349--363 (2020; Zbl 07500663) Full Text: DOI OpenURL
Beimel, Amos; Farràs, Oriol The share size of secret-sharing schemes for almost all access structures and graphs. (English) Zbl 07496614 Pass, Rafael (ed.) et al., Theory of cryptography. 18th international conference, TCC 2020, Durham, NC, USA, November 16–19, 2020. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 12552, 499-529 (2020). MSC: 94A62 94A60 05C42 05C82 94D10 PDF BibTeX XML Cite \textit{A. Beimel} and \textit{O. Farràs}, Lect. Notes Comput. Sci. 12552, 499--529 (2020; Zbl 07496614) Full Text: DOI OpenURL
Li, Yinkui; Qin, Xiaoxiao; Li, Wen; Wang, Xiaoling; Ma, Haicheng Connected even factors in \(k\)-tree. (English) Zbl 1475.05102 Open Math. 18, 1601-1605 (2020). MSC: 05C45 05C42 05C70 PDF BibTeX XML Cite \textit{Y. Li} et al., Open Math. 18, 1601--1605 (2020; Zbl 1475.05102) Full Text: DOI OpenURL
Wang, Jiabing; Wang, Rongjie; Wei, Jia; Ma, Qianli; Wen, Guihua Finding dense subgraphs with maximum weighted triangle density. (English) Zbl 1474.68230 Inf. Sci. 539, 36-48 (2020). MSC: 68R10 05C42 05C85 PDF BibTeX XML Cite \textit{J. Wang} et al., Inf. Sci. 539, 36--48 (2020; Zbl 1474.68230) Full Text: DOI OpenURL
Zhang, Peng; Liu, Zhendong Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph. (English) Zbl 1482.68188 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 161-172 (2020). MSC: 68R10 05C42 68W25 90C27 PDF BibTeX XML Cite \textit{P. Zhang} and \textit{Z. Liu}, Lect. Notes Comput. Sci. 12290, 161--172 (2020; Zbl 1482.68188) Full Text: DOI OpenURL
Das, Shagnik; Treglown, Andrew Ramsey properties of randomly perturbed graphs: cliques and cycles. (English) Zbl 1466.05128 Comb. Probab. Comput. 29, No. 6, 830-867 (2020). MSC: 05C55 05C80 05D10 05C42 PDF BibTeX XML Cite \textit{S. Das} and \textit{A. Treglown}, Comb. Probab. Comput. 29, No. 6, 830--867 (2020; Zbl 1466.05128) Full Text: DOI arXiv OpenURL