Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsAcyclic.of_subsingleton

∀ {V : Type u_1} [Subsingleton V] {G : SimpleGraph V}, G.IsAcyclic
Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
2 results in Mathlib
Foundations
Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Subsingleton
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.IsTree.of_subsingleton · cited by 1IsTree.of_subsingletonSimpleGraph.Subgraph.isAcyclic_coe_bot · cited by 0Subgraph.isAcyclic_coe_botLE.le.trans · cited by 3151le.transSimpleGraph · cited by 3072SimpleGraphSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicone_le_two · cited by 44one_le_twoENat.card_le_one · cited by 1ENat.card_le_oneSimpleGraph.IsAcyclic.of_card_le_two · cited by 1IsAcyclic.of_card_le_twoIsAcyclic.of_subsingletonCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.