1,122 research outputs found
Spanning trees of 3-uniform hypergraphs
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting
spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done
in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and
related to the class of Pfaffian graphs. We prove a complexity result for
recognizing a 3-Pfaffian 3-graph and describe two large classes of 3-Pfaffian
3-graphs -- one of these is given by a forbidden subgraph characterization
analogous to Little's for bipartite Pfaffian graphs, and the other consists of
a class of partial Steiner triple systems for which the property of being
3-Pfaffian can be reduced to the property of an associated graph being
Pfaffian. We exhibit an infinite set of partial Steiner triple systems that are
not 3-Pfaffian, none of which can be reduced to any other by deletion or
contraction of triples.
We also find some necessary or sufficient conditions for the existence of a
spanning tree of a 3-graph (much more succinct than can be obtained by the
currently fastest polynomial-time algorithm of Gabow and Stallmann for finding
a spanning tree) and a superexponential lower bound on the number of spanning
trees of a Steiner triple system.Comment: 34 pages, 9 figure
Keyword Search on RDF Graphs - A Query Graph Assembly Approach
Keyword search provides ordinary users an easy-to-use interface for querying
RDF data. Given the input keywords, in this paper, we study how to assemble a
query graph that is to represent user's query intention accurately and
efficiently. Based on the input keywords, we first obtain the elementary query
graph building blocks, such as entity/class vertices and predicate edges. Then,
we formally define the query graph assembly (QGA) problem. Unfortunately, we
prove theoretically that QGA is a NP-complete problem. In order to solve that,
we design some heuristic lower bounds and propose a bipartite graph
matching-based best-first search algorithm. The algorithm's time complexity is
, where is the number of the keywords and is a
tunable parameter, i.e., the maximum number of candidate entity/class vertices
and predicate edges allowed to match each keyword. Although QGA is intractable,
both and are small in practice. Furthermore, the algorithm's time
complexity does not depend on the RDF graph size, which guarantees the good
scalability of our system in large RDF graphs. Experiments on DBpedia and
Freebase confirm the superiority of our system on both effectiveness and
efficiency
Chromatic Numbers of Simplicial Manifolds
Higher chromatic numbers of simplicial complexes naturally
generalize the chromatic number of a graph. In any fixed dimension
, the -chromatic number of -complexes can become arbitrarily
large for [6,18]. In contrast, , and only
little is known on for .
A particular class of -complexes are triangulations of -manifolds. As a
consequence of the Map Color Theorem for surfaces [29], the 2-chromatic number
of any fixed surface is finite. However, by combining results from the
literature, we will see that for surfaces becomes arbitrarily large
with growing genus. The proof for this is via Steiner triple systems and is
non-constructive. In particular, up to now, no explicit triangulations of
surfaces with high were known.
We show that orientable surfaces of genus at least 20 and non-orientable
surfaces of genus at least 26 have a 2-chromatic number of at least 4. Via a
projective Steiner triple systems, we construct an explicit triangulation of a
non-orientable surface of genus 2542 and with face vector
that has 2-chromatic number 5 or 6. We also give orientable examples with
2-chromatic numbers 5 and 6.
For 3-dimensional manifolds, an iterated moment curve construction [18] along
with embedding results [6] can be used to produce triangulations with
arbitrarily large 2-chromatic number, but of tremendous size. Via a topological
version of the geometric construction of [18], we obtain a rather small
triangulation of the 3-dimensional sphere with face vector
and 2-chromatic number 5.Comment: 22 pages, 11 figures, revised presentatio
Partitioning Perfect Graphs into Stars
The partition of graphs into "nice" subgraphs is a central algorithmic
problem with strong ties to matching theory. We study the partitioning of
undirected graphs into same-size stars, a problem known to be NP-complete even
for the case of stars on three vertices. We perform a thorough computational
complexity study of the problem on subclasses of perfect graphs and identify
several polynomial-time solvable cases, for example, on interval graphs and
bipartite permutation graphs, and also NP-complete cases, for example, on grid
graphs and chordal graphs.Comment: Manuscript accepted to Journal of Graph Theor
Recommended from our members
Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
We review results for the embedding of orthogonal partial Latin squares in orthogonal Latin squares, comparing and contrasting these with results for embedding partial Latin squares in Latin squares. We also present a new construction that uses the existence of a set of mutually orthogonal Latin squares of order to construct a set of mutually orthogonal Latin squares of order
Covering Partial Cubes with Zones
A partial cube is a graph having an isometric embedding in a hypercube.
Partial cubes are characterized by a natural equivalence relation on the edges,
whose classes are called zones. The number of zones determines the minimal
dimension of a hypercube in which the graph can be embedded. We consider the
problem of covering the vertices of a partial cube with the minimum number of
zones. The problem admits several special cases, among which are the problem of
covering the cells of a line arrangement with a minimum number of lines, and
the problem of finding a minimum-size fibre in a bipartite poset. For several
such special cases, we give upper and lower bounds on the minimum size of a
covering by zones. We also consider the computational complexity of those
problems, and establish some hardness results
- …