10 research outputs found
Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy of a
graph, where for each natural number , we seek a vertex ordering such every
vertex can (weakly respectively strongly) reach in steps only few vertices
with lower index in the ordering. Both notions capture the sparsity of a graph
or a graph class, and have interesting applications in the structural and
algorithmic graph theory. Recently, the first author together with McCarty and
Norin observed a natural volume-based upper bound for the strong coloring
numbers of intersection graphs of well-behaved objects in , such
as homothets of a centrally symmetric compact convex object, or comparable
axis-aligned boxes.
In this paper, we prove upper and lower bounds for the -th weak coloring
numbers of these classes of intersection graphs. As a consequence, we describe
a natural graph class whose strong coloring numbers are polynomial in , but
the weak coloring numbers are exponential. We also observe a surprising
difference in terms of the dependence of the weak coloring numbers on the
dimension between touching graphs of balls (single-exponential) and hypercubes
(double-exponential)
Integer programs with bounded subdeterminants and two nonzeros per row
We give a strongly polynomial-time algorithm for integer linear programs
defined by integer coefficient matrices whose subdeterminants are bounded by a
constant and that contain at most two nonzero entries in each row. The core of
our approach is the first polynomial-time algorithm for the weighted stable set
problem on graphs that do not contain more than vertex-disjoint odd cycles,
where is any constant. Previously, polynomial-time algorithms were only
known for (bipartite graphs) and for .
We observe that integer linear programs defined by coefficient matrices with
bounded subdeterminants and two nonzeros per column can be also solved in
strongly polynomial-time, using a reduction to -matching
The ?-t-Net Problem
We study a natural generalization of the classical ?-net problem (Haussler - Welzl 1987), which we call the ?-t-net problem: Given a hypergraph on n vertices and parameters t and ? ? t/n, find a minimum-sized family S of t-element subsets of vertices such that each hyperedge of size at least ? n contains a set in S. When t=1, this corresponds to the ?-net problem.
We prove that any sufficiently large hypergraph with VC-dimension d admits an ?-t-net of size O((1+log t)d/? log 1/?). For some families of geometrically-defined hypergraphs (such as the dual hypergraph of regions with linear union complexity), we prove the existence of O(1/?)-sized ?-t-nets.
We also present an explicit construction of ?-t-nets (including ?-nets) for hypergraphs with bounded VC-dimension. In comparison to previous constructions for the special case of ?-nets (i.e., for t=1), it does not rely on advanced derandomization techniques. To this end we introduce a variant of the notion of VC-dimension which is of independent interest
Almost all string graphs are intersection graphs of plane convex sets
A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that some pair of them is not connected by any edge (n→∞). We also show that every graph with the above property is an intersection graph of plane convex sets. As a corollary, we obtain that almost all string graphs on n vertices are intersection graphs of plane convex sets