Largest sparse subgraphs of random graphs

Largest sparse subgraphs of random graphs

Show other versions (2)

For the Erdo{double acute}s-Rényi random graph G n,p, we give a precise asymptotic formula for the size α̂t(Gn,p) of a largest vertex subset in G n,p that induces a subgraph with average degree at most t, provided that p = p (n) is not too small and t = t (n) is not too large. In the case of fixed t...

Bibliografske podrobnosti
Main Authors:	Fountoulakis, N, Kang, R, McDiarmid, C
Format:	Journal article
Jezik:	English
Izdano:	2014

Podobne knjige/članki

Largest sparse subgraphs of random graphs.
od: Fountoulakis, N, et al.
Izdano: (2011)

Largest sparse subgraphs of random graphs
od: Mcdiarmid, C, et al.
Izdano: (2012)

Bisecting sparse random graphs.
od: Luczak, M, et al.
Izdano: (2001)

The t-stability number of a random graph
od: Fountoulakis, N, et al.
Izdano: (2008)

Upper bounds on the non-3-colourability threshold of random graphs.
od: Fountoulakis, N, et al.
Izdano: (2002)

The component structure of dense random subgraphs of the hypercube
od: McDiarmid, C, et al.
Izdano: (2021)

Upper bounds on the non-3-colourability threshold of random graphs
od: Nikolaos Fountoulakis, et al.
Izdano: (2002-01-01)

Upper bounds on the non- 3-colourability threshold of random graphs
od: Nikolaos Fountoulakis, et al.
Izdano: (2002-12-01)

Random graphs on surfaces.
od: McDiarmid, C
Izdano: (2008)

The t-improper chromatic number of random graphs
od: Kang, R, et al.
Izdano: (2008)

The t-Improper Chromatic Number of Random Graphs
od: Kang, R, et al.
Izdano: (2010)

Thresholds and the structure of sparse random graphs
od: Fountoulakis, N
Izdano: (2003)

Analysis of size of the largest dense subgraph of random hypergraph
od: N. N. Kuzyrin, et al.
Izdano: (2018-10-01)

Random perfect graphs
od: McDiarmid, C, et al.
Izdano: (2018)

Random unlabelled graphs containing few disjoint cycles.
od: Kang, M, et al.
Izdano: (2011)

Random Graphs from a Minor-Closed Class.
od: McDiarmid, C
Izdano: (2009)

On the Number of Edges in Random Planar Graphs.
od: Gerke, S, et al.
Izdano: (2004)

On the chromatic number of random geometric graphs
od: McDiarmid, C, et al.
Izdano: (2011)

On the chromatic number of random geometric graphs
od: McDiarmid, C, et al.
Izdano: (2011)

Random graphs from a weighted minor-closed class
od: McDiarmid, C
Izdano: (2012)

Connectivity for random graphs from a weighted bridge-addable class
od: McDiarmid, C
Izdano: (2012)

Random graphs with few disjoint cycles
od: Kurauskas, V, et al.
Izdano: (2010)

Modularity in random regular graphs and lattices.
od: McDiarmid, C, et al.
Izdano: (2013)

Modularity of Erdos-Rényi random graphs
od: McDiarmid, C, et al.
Izdano: (2018)

Dense subgraphs in random graphs
od: Balister, P, et al.
Izdano: (2019)

On the spread of random graphs
od: McDiarmid, C, et al.
Izdano: (2014)

Random planar graphs
od: McDiarmid, C, et al.
Izdano: (2005)

On the spread of random graphs
od: Addario-Berry, L, et al.
Izdano: (2009)

On the Maximum Degree of a Random Planar Graph.
od: McDiarmid, C, et al.
Izdano: (2008)

Random cubic planar graphs.
od: Bodirsky, M, et al.
Izdano: (2007)

Random Graphs Containing Few Disjoint Excluded Minors
od: McDiarmid, C, et al.
Izdano: (2014)

Random graphs from a block-stable class
od: McDiarmid, C, et al.
Izdano: (2016)

Clique colouring of binomial random graphs
od: McDiarmid, C, et al.
Izdano: (2018)

Random subgraphs of certain graph powers
od: Lane Clark
Izdano: (2002-01-01)

Colouring random geometric graphs
od: Colin J. H. McDiarmid, et al.
Izdano: (2005-01-01)

Cycles in edge-coloured graphs and subgraphs of random graphs
od: White, M
Izdano: (2011)

Graph Imperfection.
od: Gerke, S, et al.
Izdano: (2001)

On graphs with few disjoint t-star minors.
od: McDiarmid, C
Izdano: (2011)

Connectivity for bridge-alterable graph classes
od: McDiarmid, C
Izdano: (2013)

The number of disk graphs
od: McDiarmid, C, et al.
Izdano: (2014)