Publication date
January 2014
DOI Publisher
Elsevier BV ISSN
0195-6698 Citation count (estimate)
1Abstract
Contains fulltext : 135134.pdf (preprint version ) (Open Access
Contains fulltext : 135134.pdf (preprint version ) (Open Access
International audienceWe determine the asymptotic behavior of the maximum subgraph density of large ...
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asym...
The purpose of this paper is to study the structure of large sparse graphs such as the graph of the ...
For the Erdős–Rényi random graph Gn,p, we give a precise asymptotic formula for the size â1(Gn,p) of...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
For the Erdős–Rényi random graph Gn,pGn,p, we give a precise asymptotic formula for the size αˆt(Gn,...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
International audienceWe determine the asymptotic behavior of the maximum subgraph density of large ...
For the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest vertex subset t...
Contains fulltext : 132813.pdf (preprint version ) (Open Access
For a constant γ∈[0,1] and a graph G, let ω γ (G) be the largest integer k for which there exists a ...
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t: G contains a vertex-ind...
Abstract. We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppst...
this paper we study eigenvalues of random graphs. The random graph G(n, p)isthe discrete probabilit...
International audienceWe consider the random hyperbolic graph model introduced by [KPK + 10] and the...
International audienceWe determine the asymptotic behavior of the maximum subgraph density of large ...
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asym...
The purpose of this paper is to study the structure of large sparse graphs such as the graph of the ...
For the Erdős–Rényi random graph Gn,p, we give a precise asymptotic formula for the size â1(Gn,p) of...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
For the Erdős–Rényi random graph Gn,pGn,p, we give a precise asymptotic formula for the size αˆt(Gn,...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
International audienceWe determine the asymptotic behavior of the maximum subgraph density of large ...
For the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest vertex subset t...
Contains fulltext : 132813.pdf (preprint version ) (Open Access
For a constant γ∈[0,1] and a graph G, let ω γ (G) be the largest integer k for which there exists a ...
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t: G contains a vertex-ind...
Abstract. We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppst...
this paper we study eigenvalues of random graphs. The random graph G(n, p)isthe discrete probabilit...
International audienceWe consider the random hyperbolic graph model introduced by [KPK + 10] and the...
International audienceWe determine the asymptotic behavior of the maximum subgraph density of large ...
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asym...
The purpose of this paper is to study the structure of large sparse graphs such as the graph of the ...
Add to ORKG