Louisiana Tech Digital Commons
metadata only
Results in lattices, ortholattices, and graphs
This dissertation contains two parts: lattice theory and graph theory. In the lattice theory part, we have two main subjects. First, the class of all distributive lattices is one of the most familiar classes of lattices. We introduce "π-versions" of five familiar equivalent conditions for distributi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#652365
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#650912
- Paired Disjunctive Domination Number of Middle Graphs#1012030
- Sequence b-colorings in graphs#985835
- Indiscernibles and satisfaction classes in arithmetic#986068
Record · ID 957961
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive