GC
2002
Springer
13 years 4 months ago
2002
Springer
Let G
GC
2002
Springer
13 years 4 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
GC
2002
Springer
13 years 4 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
GC
2002
Springer
13 years 4 months ago
2002
Springer
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
GC
2002
Springer
13 years 4 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
GC
2002
Springer
13 years 4 months ago
2002
Springer
One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, know...
GC
2002
Springer
13 years 4 months ago
2002
Springer
The existence of group divisible designs of type gt with block sizes three and n, 4 n 10, is completely settled for all values of g and t.
GC
2002
Springer
13 years 4 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
GC
2002
Springer
13 years 4 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
GC
2002
Springer
13 years 4 months ago
2002
Springer
We give a complete description of the geometric hyperplanes of the 759-point near hexagon belonging to M24.