Answer by bof for For any finite simple graph $G$, can we always find an...
I don't understand your solution. Here's how I'd do it. Let $G=(V,E)$ be a simple graph, finite or infinite. Let $S=V\cup E.$ (Of course, if $G$ is finite, then $S$ is finite.) For each vertex $v\in V$...
View ArticleFor any finite simple graph $G$, can we always find an intersection graph of...
Let $G=(V,E)$ be a finite simple graph. Does there exist a finite set $S$ and $S_G\subseteq P(S)$ such that the intersection graph $H$ of $S_G$ is isomorphic to $G$, i.e. $H\cong G$.Here's my idea:If I...
View Article
More Pages to Explore .....
