DM
1998
13 years 11 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
DM
1998
13 years 11 months ago
1998
DM
1998
13 years 11 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
DM
1998
13 years 11 months ago
1998
DM
1998
13 years 11 months ago
1998
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
DM
1998
13 years 11 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
DM
1998
13 years 11 months ago
1998
DM
1998
13 years 11 months ago
1998
DM
1998
13 years 11 months ago
1998
DM
1998
13 years 11 months ago
1998
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...