I'm just a humble undergrad doing some research. I found that for one of my proofs, every step was equally valid for finite or infinite graphs, except one crucial argument.
At this step I used the fact that every graph has a spanning tree (if finite...) and proceeded to finish the proof.
Now I look back and wonder if can extend my result to the infinite case. However, as far as I can tell this would require a Spanning Tree Theorem for the infinite case. Anyone know anything about this?
Curious: Minimal spanning trees for weighted infinite graphs?
Curious: Introductory resources on infinite graphs?
Thanks in Advance