Dense Subgraphs in Random Graphs

Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev

Type: Preprint

Publication Date: 2018-03-27

Citations: 1

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Dense Subgraphs in Random Graphs	2018	Paul Balister Béla Bollobás Julian Sahasrabudhe Alexander Veremyev
+	Dense subgraphs in random graphs	2019	Paul Balister Béla Bollobás Julian Sahasrabudhe Alexander Veremyev
+	Random cliques in random graphs	2018	Oliver Riordan
+	Finding Dense Subgraphs in G(n,1/2)	2008	Atish Das Sarma Amit Deshpande Ravi Kannan
+	Finding Dense Subgraphs in G(n,1/2)	2010	Atish Das Sarma Amit Deshpande Ravi Kannan
+ PDF Chat	The Largest Hole in Sparse Random Graphs	2021	Nemanja Draganić Stefan Glock Michael Krivelevich
+	The largest hole in sparse random graphs	2021	Nemanja Draganić Stefan Glock Michael Krivelevich
+	Sparse Quasi-Random Graphs	2002	Fan Chung Ronald L. Graham
+	Large holes in sparse random graphs	1987	Alan Frieze Bill Jackson
+ PDF Chat	Small Dense Subgraphs of a Graph	2017	Tao Jiang Andrew Newman
+	Random triangles in random graphs	2018	Annika Heckel
+	Maximum Induced Trees in Sparse Random Graphs	2024	J. C. Buitrago Oropeza
+	Random triangles in random graphs	2018	Annika Heckel
+	Upper Tails of Subgraph Counts in Sparse Regular Graphs	2021	Benjamin Gunby
+	Clique-factors in sparse pseudorandom graphs	2018	Jie Han Yoshiharu Kohayakawa Patrick Morris Yury Person
+	Large Cliques in Sparse Random Intersection Graphs	2017	Mindaugas Bloznelis Valentas Kurauskas
+	Bipartite decomposition of random graphs	2014	Noga Alon
+	Bipartite decomposition of random graphs	2014	Noga Alon
+	Maximal induced trees in sparse random graphs	1988	Tomasz Łuczak Zbigniew Pałka
+	Super-logarithmic cliques in dense inhomogeneous random graphs	2019	Gweneth McKinley

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Enumerating Top-k Quasi-Cliques	2018	Seyed-Vahid Sanei-Mehri Apurba Das Srikanta Tirthapura

Works Cited by This (6)

Action	Title	Year	Authors
+ PDF Chat	On clique relaxation models in network analysis	2012	Jeffrey Pattillo Nataly Youssef Sergiy Butenko
+ PDF Chat	Some remarks on the theory of graphs	1947	P. Erdős
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey
+	On colouring random graphs	1975	Geoffrey Grimmett Colin McDiarmid
+	Cliques in random graphs	1976	B Bollobás P. Erdős
+	Connectivity and generalized cliques in sociometric group structure	1950	R. Duncan Luce