On the dispersability of graph bundles over cycles
Abstract
In this paper, the dispersability of the Cartesian graph bundle over two cycles is completely solved. We show the Cartesian graph bundle G over two cycles is dispersable if G is bipartite; otherwise, G is nearly dispersable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.