Mathematics Asked by laurencevs on January 3, 2022

I’m reading Béla Bollobás’s *Modern Graph Theory* and one of the exercises (I.10) says the following:

Show that in an infinite graph $G$ with countably many edges there exists a set of cycles and two-way infinite paths such that each edge of $G$ belongs to exactly one of these iff for every $X subset V(G)$ either there are infinitely many edges joining $X$ to $V(G)-X$, or else $e(X,V(G)-X)$ is even.

I’m a bit confused by this, because if we consider a single infinite path $dots, -2, -1, 0, 1, 2, dots$ and take $X=lbrace1,2,3,dotsrbrace$ then I think we find that $e(X,V(G)-X)$ is one: there is only the edge from $0$ to $1$. Thus this graph satisfies the first requirement but not the second, contradicting the claim that they are equivalent.

Should the statement specify that the sets $X$ are to be *finite*, or have I missed something here?

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- Peter Machado on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?
- Joshua Engel on Why fry rice before boiling?
- haakon.io on Why fry rice before boiling?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP