Cliques that are tolerance digraphs

In this paper, we study directed graph versions of tolerance graphs, in particular, the class of totally bounded bitolerance digraphs and several subclasses. When the underlying graph is complete, we prove that the classes of totally bounded bitolerance digraphs and interval catch digraphs are equal, and this implies a polynomial-time recognition algorithm for the former class. In addition, we give examples (whose underlying graphs are complete) to separate every other pair of subclasses, and one of these provides a counterexample to a conjecture of Maehara (1984).     

Unit and proper bitolerance digraphs

In this paper we prove that the following statements about a directed graph G→ are equivalent. (1) G→ is a unit bitolerance digraph, (2) G→ is a proper bitolerance digraph, and (3) the digraph obtained by reversing all arc directions of G→ is an interval catch digraph (also known as a point-core digraph). This result combined with known algorithms for recognizing interval catch digraphs, gives the first known polynomial-time algorithm for recognizing a class of (bi)tolerance digraphs. © 1997 John Wiley & Sons, Inc.     

On point-halfspace graphs

The following definition is motivated by the study of circle orders and their connections to graphs. A graphs G is called a point-halfspace graph (in R ^k) provided one can assign to each vertex v ? (G) a point p _v R ^k and to each edge e ? E(G) a closed halfspace H_e ? R ^k so that v is incident with e if and only if p _v ? H_e. Let H ^k denote the set of point-halfspace graphs (in R ^k). We give complete forbidden subgraph and structural characterizations of the classes H ^k for every k. Surprisingly, these classes are closed under taking minors and we give forbidden minor characterizations as well. © 1996 John Wiley & Sons, Inc.     

On the Fractional Intersection Number of a Graph

 An intersection representation of a graph G is a function f:V(G)→2^S (where S is any set) with the property that uv∈E(G) if and only if f(u)∩f(v)≠∅. The size of the representation is |S|. The intersection number of G is the smallest size of an intersection representation of G. The intersection number can be expressed as an integer program, and the value of the linear relaxation of that program gives the fractional intersection number. This is in consonance with fractional versions of other graph invariants such as matching number, chromatic number, edge chromatic number, etc.  We examine cases where the fractional and ordinary intersection numbers are the same (interval and chordal graphs), as well as cases where they are wildly different (complete multipartite graphs). We find the fractional intersection number of almost all graphs by considering random graphs. Received: July 1, 1996 Revised: August 11, 1997     

Archimedean ϕ ‐tolerance graphs

Let ? be a symmetric binary function, positive valued on positive arguments. A graph G = (V,E) is a ?‐tolerance graph if each vertex υ ∈ V can be assigned a closed interval I_υ and a positive tolerance t_υ so that xy ∈ E ? | I_x ∩ I_y|≥ ? (t_x,t_y). An Archimedean function has the property of tending to infinity whenever one of its arguments tends to infinity. Generalizing a known result of [15] for trees, we prove that every graph in a large class (which includes all chordless suns and cacti and the complete bipartite graphs K_2,k) is a ?‐tolerance graph for all Archimedean functions ?. This property does not hold for most graphs. Next, we present the result that every graph G can be represented as a ?_G‐tolerance graph for some Archimedean polynomial ?_G. Finally, we prove that there is a ?universal”? Archimedean function ? ^* such that every graph G is a ?^*‐tolerance graph. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 179–194, 2002     

Comparability Invariance Results for Tolerance Orders

We prove comparability invariance results for three classes of ordered sets: bounded tolerance orders (equivalent to parallelogram orders), unit bitolerance orders (equivalent to point-core bitolerance orders) and unit tolerance orders (equivalent to 50% tolerance orders). Each proof uses a different technique and relies on the alternate characterization.     

Range of the Fractional Weak Discrepancy Function

In this paper we describe the range of values that can be taken by the fractional weak discrepancy of a poset and characterize semiorders in terms of these values. In [6], we defined the fractional weak discrepancy of a poset to be the minimum nonnegative for which there exists a function satisfying (1) if then and (2) if then . This notion builds on previous work on weak discrepancy in [3, 7, 8]. We prove here that the range of values of the function is the set of rational numbers that are either at least one or equal to for some nonnegative integer . Moreover, is a semiorder if and only if , and the range taken over all semiorders is the set of such fractions .The third author's work was supported in part by a Wellesley College Brachman Hoffman Fellowship.     

Fractional weak discrepancy and split semiorders

The fractional weak discrepancywd_F(P) of a poset P=(V,?) was introduced in Shuchat et al. (2007) [6] as the minimum nonnegative k for which there exists a function f:V→R satisfying (i) if a?b then f(a)+1≤f(b) and (ii) if a∥b then |f(a)−f(b)|≤k. In this paper we generalize results in Shuchat et al. (2006, 2009) [5] and [7] on the range of wd_F for semiorders to the larger class of split semiorders. In particular, we prove that for such posets the range is the set of rationals that can be represented as r/s for which 0≤s−1≤r<2s.     

Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets

The linear discrepancy of a partially ordered set P=(X,) is the least integer k for which there exists an injection f: XZ satisfying (i) if xy then f(x)<f(y) and (ii) if xy then |f(x)–f(y)|k. This concept is closely related to the weak discrepancy of P studied previously. We prove a number of properties of linear and weak discrepancies and relate them to other poset parameters. Both parameters have applications in ranking the elements of a partially ordered set so that the difference in rank of incomparable elements is minimized.