query: Is there any connection between distributive lattices and planar graphs?
positive_passages.docid: 153550
positive_passages.text: Is there any connection between distributive lattices and planar graphs?
negative_passages.docid: 27661
negative_passages.text: The closed graph theorem in topology
negative_passages.docid: 115502
negative_passages.text: Analogue of the Cantor-Bernstein-Schroeder theorem for general algebraic structures
negative_passages.docid: 146664
negative_passages.text: The union of two linearly independent subsets
negative_passages.docid: 46841
negative_passages.text: When is a graph isomorphic to the source?
negative_passages.docid: 59831
negative_passages.text: How to relate combinatorial proof to bipartite graphs?
negative_passages.docid: 87451
negative_passages.text: Construction of matrices under ZFC axioms
negative_passages.docid: 117685
negative_passages.text: Prove that a bipartite planar graph has a vertex of degree at most 3
negative_passages.docid: 143951
negative_passages.text: Can we determine uniform continuity from graphs?
negative_passages.docid: 121642
negative_passages.text: Draw arrows to show multiplication pattern (distributive property)
negative_passages.docid: 116538
negative_passages.text: Proof of Connected Diagrams
negative_passages.docid: 33373
negative_passages.text: Balanced orientation of infinite graphs
negative_passages.docid: 32081
negative_passages.text: The dual version of trichotomy of cardinality without AC
negative_passages.docid: 43845
negative_passages.text: Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
negative_passages.docid: 72417
negative_passages.text: Bipartite graphs
negative_passages.docid: 92554
negative_passages.text: How many lattice paths are there from $(0,0)$ to $(2n,2n)$ that avoids odd points
negative_passages.docid: 89506
negative_passages.text: Union of disjoint sets : Equivalence relations