DM
2000
13 years 11 months ago
2000
DM
2000
13 years 11 months ago
2000
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous coloring. He used this concept to reformulate a conjecture of Keedwell ...
DM
2000
13 years 11 months ago
2000
DM
2000
13 years 11 months ago
2000
DM
2000
13 years 11 months ago
2000
DM
2000
13 years 11 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
DM
2000
13 years 11 months ago
2000
DM
2000
13 years 11 months ago
2000
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
DM
2000
13 years 11 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
DM
2000
13 years 11 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...