On the number of reachable pairs in a digraph

zbMath1444.05061arXiv1709.05390MaRDI QIDQ3300699

Eric Swartz, Nicholas J. Werner

Publication date: 29 July 2020

Full work available at URL: https://arxiv.org/abs/1709.05390

zbMATH Keywords

reachable pair

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Obtainable sizes of topologies on finite sets
• On the cardinalities of finite topologies and the number of antichains in partially ordered sets
• On the cardinalities of finite topologies
• On the number of open sets of finite topologies
• Digraphs
• Quasi-Orderings and Topologies on Finite Sets
• The number of reachable pairs in a digraph

This page was built for publication: On the number of reachable pairs in a digraph