SIAMDM
2008
13 years 6 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
GC
2007
Springer
13 years 6 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
ORL
2008
13 years 6 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
ORL
2008
13 years 6 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
EJC
2007
13 years 6 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
COMBINATORICS
2006
13 years 6 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
ALGORITHMICA
2006
13 years 6 months ago
2006
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
4OR
2006
13 years 6 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
DM
2008
13 years 6 months ago
2008
We investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two parallel sides is a. (An equidissection is a dissection into triangles of equal areas.) A...
DM
2008
13 years 6 months ago
2008
Let m 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1