Skip to main content
added a top-level tag
Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40
edited body
Source Link
GA316
  • 1.3k
  • 11
  • 24

Let $V$ be a set of $n$ vertices. Fix $3 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_n(\mathcal S)$$G_k(\mathcal S)$.

  1. I want to learn how the graph $G_n(\mathcal S)$$G_k(\mathcal S)$ looks like?

  2. Is there any name for $G_n(\mathcal S)$$G_k(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

Let $V$ be a set of $n$ vertices. Fix $3 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_n(\mathcal S)$.

  1. I want to learn how the graph $G_n(\mathcal S)$ looks like?

  2. Is there any name for $G_n(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

Let $V$ be a set of $n$ vertices. Fix $3 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_k(\mathcal S)$.

  1. I want to learn how the graph $G_k(\mathcal S)$ looks like?

  2. Is there any name for $G_k(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

edited body
Source Link
GA316
  • 1.3k
  • 11
  • 24

Let $V$ be a set of $n$ vertices. Fix $1 \le k \le n$$3 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_n(\mathcal S)$.

  1. I want to learn how the graph $G_n(\mathcal S)$ looks like?

  2. Is there any name for $G_n(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

Let $V$ be a set of $n$ vertices. Fix $1 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_n(\mathcal S)$.

  1. I want to learn how the graph $G_n(\mathcal S)$ looks like?

  2. Is there any name for $G_n(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

Let $V$ be a set of $n$ vertices. Fix $3 \le k \le n$. Let $\binom V k$ be the set of all $k$ element subsets of $V$.

We add the edges in $V$ as follows: Let $\mathcal S \subseteq \binom V k$ be fixed. For each $F \in \mathcal S$, I am making the vertices in $F$ mutually adjacent. Let's call this graph $G_n(\mathcal S)$.

  1. I want to learn how the graph $G_n(\mathcal S)$ looks like?

  2. Is there any name for $G_n(\mathcal S)$ in the literature?

  3. Some references regarding these graphs.

Kindly share your thoughts. Thank you.

Source Link
GA316
  • 1.3k
  • 11
  • 24
Loading