Abstract
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cycle-free case, but generalizing to cases where this may be violated.
| Original language | English |
|---|---|
| Pages (from-to) | 349-357 |
| Number of pages | 9 |
| Journal | Order |
| Volume | 25 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2008 |