8 search results - page 1 / 2 » Induced subgraphs of Ramsey graphs with many distinct degree... |
JCT
2007
13 years 5 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
COMBINATORICS
2007
13 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
JGAA
2010
13 years 4 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
MFCS
2007
Springer
14 years 4 days ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
COMBINATORICA
2007
13 years 6 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...