query: Deciding transitivity of a directed acyclic graph
positive_passages.docid: 18462
positive_passages.text: Transitivity check vs. Transitive Closure
negative_passages.docid: 63379
negative_passages.text: Enumerate non-isomorphic graphs on n vertices
negative_passages.docid: 25155
negative_passages.text: Suppose $R$ and $S$ are transitive relations on $A$. Prove that if $S \circ R \subseteq R \circ S$ then $R \circ S$ is transitive.
negative_passages.docid: 33373
negative_passages.text: Balanced orientation of infinite graphs
negative_passages.docid: 134588
negative_passages.text: Seeking a direct proof about nested inclusions
negative_passages.docid: 46841
negative_passages.text: When is a graph isomorphic to the source?
negative_passages.docid: 90747
negative_passages.text: Upper bound on $\chi(G)$ for a triangle-free graph
negative_passages.docid: 52568
negative_passages.text: What exactly does LocalClusteringCoefficient compute for directed graphs?
negative_passages.docid: 121402
negative_passages.text: Planar Realization of a Graph in Three-Space
negative_passages.docid: 73334
negative_passages.text: Proving this relation is transitive
negative_passages.docid: 44563
negative_passages.text: Weakly Connected Graphs
negative_passages.docid: 117349
negative_passages.text: counting triangles in a graph or its complement
negative_passages.docid: 99346
negative_passages.text: Prove a result on transitive group actions.
negative_passages.docid: 111954
negative_passages.text: Computing the cardinality of a combinatorial set
negative_passages.docid: 56092
negative_passages.text: What is complexity of this max-edge subgraph problem?
negative_passages.docid: 137921
negative_passages.text: Reflexivity, Transitivity, Symmertry of the square of an relation
negative_passages.docid: 27407
negative_passages.text: every planar graph can be expressed as a union of five edge-disjoint forests