Theorems · Definition · combinatorics
SimpleGraph.Walk.toSubgraph
{V : Type u} → {G : SimpleGraph V} → {u v : V} → G.Walk u v → G.SubgraphThe subgraph consisting of the vertices and edges of the walk.
- Cited by
- 49 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Subgraphstatement · cited by 326
- SimpleGraph.Walk.brecOnproof · cited by 15
Cited by54
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.verts_toSubgraphstatement · cited by 7
- SimpleGraph.Walk.mem_verts_toSubgraphstatement and proof · cited by 6
- SimpleGraph.Walk.end_mem_verts_toSubgraphstatement · cited by 5
- SimpleGraph.Walk.start_mem_verts_toSubgraphstatement · cited by 5
- SimpleGraph.Walk.toSubgraph_adj_getVertstatement and proof · cited by 4
- SimpleGraph.Walk.mapToSubgraphstatement · cited by 4
- SimpleGraph.Walk.IsCycle.ncard_neighborSet_toSubgraph_eq_twostatement and proof · cited by 3
- SimpleGraph.Walk.toSubgraph_connectedstatement and proof · cited by 3
- SimpleGraph.Walk.mem_edges_toSubgraphstatement and proof · cited by 3
- SimpleGraph.Walk.IsCycle.neighborSet_toSubgraph_endpointstatement and proof · cited by 2
- SimpleGraph.Walk.toSubgraph_adj_sndstatement and proof · cited by 2
- SimpleGraph.Walk.toSubgraph_appendstatement and proof · cited by 2