https://www.johndcook.com/blog/2020/02/27/numerical-heron/

The conjecture is: The Möbius Ladder on (2n) vertices always has one more spanning unicyclic subgraph than the Prism Graph on the same (2n) vertices.

I want to believe they match up in some way except the Möbius Ladder has one special one that doesn't make sense on the prism... and I can even guess that the "odd one out" for the Möbius Ladder is a a single cycle through all the vertices like the boundary of the Möbius band, but I don't see how to pair the rest up nicely.

A "spanning unicyclic subgraph" is a subgraph which has a unique cycle, probably best thought of as "a spanning tree plus one more edge."

(Bear with me, the fun part is coming up.)

I have a graph theory observation/conjecture which seems like it should be easy. Maybe someone will see it right away; I messed around for a depressing amount of time without success.

We'll need to know what a Prism Graph and a Möbius Ladder Graph are.

https://en.wikipedia.org/wiki/Prism_graph

https://en.wikipedia.org/wiki/M%C3%B6bius_ladder

https://youtu.be/jjT3_NMe45I?t=124

The MAA maintains a list of recommendations for library holdings in mathematics: https://www.maa.org/press/maa-reviews/the-basic-library-list-maas-recommendations-for-undergraduate-libraries

Does anyone know of a similar resource for computer science?

After $bigint years, I *still* find it difficult to make a good 2-hour final for a calculus class. I think I end up with decent ones, but I spend unconscionable amounts of time designing, balancing, trimming, simplifying, ordering, usf, usw.

I took a look around to see what tips & tricks I could steal for composing good calculus tests, and there's either very little on the web, or it's just too hard to find because it's buried by tips on *taking* (mostly standardized) calculus tests.

Herzlich Willkommen in Minnesota!

Joined Jan 2019