17 research outputs found
Toric algebra of hypergraphs
The edges of any hypergraph parametrize a monomial algebra called the edge
subring of the hypergraph. We study presentation ideals of these edge subrings,
and describe their generators in terms of balanced walks on hypergraphs. Our
results generalize those for the defining ideals of edge subrings of graphs,
which are well-known in the commutative algebra community, and popular in the
algebraic statistics community. One of the motivations for studying toric
ideals of hypergraphs comes from algebraic statistics, where generators of the
toric ideal give a basis for random walks on fibers of the statistical model
specified by the hypergraph. Further, understanding the structure of the
generators gives insight into the model geometry.Comment: Section 3 is new: it explains connections to log-linear models in
algebraic statistics and to combinatorial discrepancy. Section 6 (open
problems) has been moderately revise
On the (non-)existence of polynomial kernels for Pl-free edge modification problems
Given a graph G = (V,E) and an integer k, an edge modification problem for a
graph property P consists in deciding whether there exists a set of edges F of
size at most k such that the graph H = (V,E \vartriangle F) satisfies the
property P. In the P edge-completion problem, the set F of edges is constrained
to be disjoint from E; in the P edge-deletion problem, F is a subset of E; no
constraint is imposed on F in the P edge-edition problem. A number of
optimization problems can be expressed in terms of graph modification problems
which have been extensively studied in the context of parameterized complexity.
When parameterized by the size k of the edge set F, it has been proved that if
P is an hereditary property characterized by a finite set of forbidden induced
subgraphs, then the three P edge-modification problems are FPT. It was then
natural to ask whether these problems also admit a polynomial size kernel.
Using recent lower bound techniques, Kratsch and Wahlstrom answered this
question negatively. However, the problem remains open on many natural graph
classes characterized by forbidden induced subgraphs. Kratsch and Wahlstrom
asked whether the result holds when the forbidden subgraphs are paths or cycles
and pointed out that the problem is already open in the case of P4-free graphs
(i.e. cographs). This paper provides positive and negative results in that line
of research. We prove that parameterized cograph edge modification problems
have cubic vertex kernels whereas polynomial kernels are unlikely to exist for
the Pl-free and Cl-free edge-deletion problems for large enough l
Large Cross-free sets in Steiner triple systems
A {\em cross-free} set of size in a Steiner triple system
is three pairwise disjoint -element subsets such that
no intersects all the three -s. We conjecture that for
every admissible there is an STS with a cross-free set of size
which if true, is best possible. We prove this
conjecture for the case , constructing an STS containing a
cross-free set of size . We note that some of the -bichromatic STSs,
constructed by Colbourn, Dinitz and Rosa, have cross-free sets of size close to
(but cannot have size exactly ).
The constructed STS shows that equality is possible for in
the following result: in every -coloring of the blocks of any Steiner triple
system STS there is a monochromatic connected component of size at least
(we conjecture that equality holds for every
admissible ).
The analogue problem can be asked for -colorings as well, if r-1 \equiv
1,3 \mbox{ (mod 6)} and is a prime power, we show that the answer is the
same as in case of complete graphs: in every -coloring of the blocks of any
STS, there is a monochromatic connected component with at least points, and this is sharp for infinitely many .Comment: Journal of Combinatorial Designs, 201
On the (non-)existence of polynomial kernels for -free edge modification problems
International audienceGiven a graph and a positive integer , an edge modification problem for a graph property consists in deciding whether there exists a set of pairs of of size at most such that the graph satisfies the property . In the \emph{edge-completion problem}, the set is constrained to be disjoint from ; in the \emph{edge-deletion problem}, is a subset of ; no constraint is imposed on in the \emph{edge-editing problem}. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameterized complexity. When parameterized by the size of the set , it has been proved that if is an hereditary property characterized by a finite set of forbidden induced subgraphs, then the three edge-modification problems are FPT. It was then natural to ask whether these problems also admit a polynomial kernel. Using recent lower bound techniques, Kratsch and Wahlström answered this question negatively. However, the problem remains open on many natural graph classes characterized by forbidden induced subgraphs. Kratsch and Wahlström asked whether the result holds when the forbidden subgraphs are paths or cycles and pointed out that the problem is already open in the case of -free graphs (i.e. cographs). This paper provides positive and negative results in that line of research. We prove that \textsc{Parameterized cograph edge-modification} problems have cubic vertex kernels whereas polynomial kernels are unlikely to exist for the \textsc{-free edge-deletion} and the \textsc{-free edge-deletion} problems for and respectively. Indeed, if they exist, then