911 research outputs found
Forbidden Directed Minors and Kelly-width
Partial 1-trees are undirected graphs of treewidth at most one. Similarly,
partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known
that an undirected graph is a partial 1-tree if and only if it has no K_3
minor. In this paper, we generalize this characterization to partial 1-DAGs. We
show that partial 1-DAGs are characterized by three forbidden directed minors,
K_3, N_4 and M_5
Are there any good digraph width measures?
Many width measures for directed graphs have been proposed in the last few years in pursuit of generalizing (the notion of) treewidth to directed graphs. However, none of these measures possesses, at the same time, the major properties of treewidth, namely, 1. being algorithmically useful , that is, admitting polynomial-time algorithms for a large class of problems on digraphs of bounded width (e.g. the problems definable in MSO1MSO1); 2. having nice structural properties such as being (at least nearly) monotone under taking subdigraphs and some form of arc contractions (property closely related to characterizability by particular cops-and-robber games). We investigate the question whether the search for directed treewidth counterparts has been unsuccessful by accident, or whether it has been doomed to fail from the beginning. Our main result states that any reasonable width measure for directed graphs which satisfies the two properties above must necessarily be similar to treewidth of the underlying undirected graph
Planar posets have dimension at most linear in their height
We prove that every planar poset of height has dimension at most
. This improves on previous exponential bounds and is best possible
up to a constant factor. We complement this result with a construction of
planar posets of height and dimension at least .Comment: v2: Minor change
Recommended from our members
Graph Theory
Graph theory is a rapidly developing area of mathematics. Recent years have seen the development of deep theories, and the increasing importance of methods from other parts of mathematics. The workshop on Graph Theory brought together together a broad range of researchers to discuss some of the major new developments. There were three central themes, each of which has seen striking recent progress: the structure of graphs with forbidden subgraphs; graph minor theory; and applications of the entropy compression method. The workshop featured major talks on current work in these areas, as well as presentations of recent breakthroughs and connections to other areas. There was a particularly exciting selection of longer talks, including presentations on the structure of graphs with forbidden induced subgraphs, embedding simply connected 2-complexes in 3-space, and an announcement of the solution of the well-known Oberwolfach Problem
- …