Search Sciweavers | Sciweavers

3757 search results - page 50 / 752

» The overlap number of a graph

click to vote

JGT
2007

85views more JGT 2007»

On graphs with subgraphs having large independence numbers

14 years 9 months ago

Download www.math.ucla.edu

: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...

Noga Alon, Benny Sudakov

claim paper

Read More »

click to vote

JUCS
2007

99views more JUCS 2007»

Spectral Densest Subgraph and Independence Number of a Graph

14 years 9 months ago

Download www.jucs.org

: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the ﬁrst part, we give an algorithm for identifying sm...

Reid Andersen, Sebastian M. Cioaba

claim paper

Read More »

189

click to vote

COMBINATORICA
2011

334views Optimization» more COMBINATORICA 2011»

On the chromatic number of random geometric graphs

13 years 9 months ago

Download homepages.cwi.nl

Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...

Colin McDiarmid, Tobias Müller

claim paper

Read More »

click to vote

DM
2006

85views more DM 2006»

Further analysis of the number of spanning trees in circulant graphs

14 years 9 months ago

Download math.uprm.edu

Let 1 s1 < s2 <

Talip Atajan, Xuerong Yong, Hiroshi Inaba

claim paper