𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic digraphs and local hierarchy theory

✍ Scribed by Adam Berliner; Ulrike Bostelmann; Richard A. Brualdi; Louis Deaett

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
212 KB
Volume
45
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic systems of representatives and a
Acyclic systems of representatives and acyclic colorings of digraphs
✍ Ron Aharoni; Eli Berger; Ori Kfir πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract A natural digraph analog of the graph theoretic concept of β€œan independent set” is that of β€œan acyclic set of vertices,” namely a set not spanning a directed cycle. By this token, an analog of the notion of coloring of a graph is that of decomposition of a digraph into acyclic sets. We

Counting acyclic digraphs by sources and
Counting acyclic digraphs by sources and sinks
✍ Ira M. Gessel πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 222 KB

We count labeled acyclic digraphs according to the number sources, sinks, and edges. ## 1. Counting acyclic digraphs by sources Let

Maximum directed cuts in acyclic digraph
Maximum directed cuts in acyclic digraphs
✍ Noga Alon; BΓ©la BollobΓ‘s; AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ‘ Lehel; Alex Scott πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

## Abstract It is easily shown that every digraph with __m__ edges has a directed cut of size at least __m__/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in __acyclic__ digraphs, and prove a number of related results concerning cuts