Intereting Posts

Transcendental number
Are there any fields with a matrix representation other than $\mathbb{C}$?
How is the set of all closed intervals countable?
Vieta jumping with non-monic polynomials
Why $2n \int ^\infty _n \frac{c}{x^2 \log(x)} \sim n \frac{C}{n \log(n)}$?
Continuity conditions for multivariate functions.
What are the A,B,C parameters of this ellipse formula?
Choices of decompositions of a representation into irreducible components (Serre, Ex. 2.8)
Does anyone know a closed-form expression for a bijection between $\mathbb{N}^k$ and $\mathbb{N}$?
Formulae of the Year 2016
Question on showing a bijection between $\pi_1(X,x_0)$ and $$ when X is path connected.
$X=(1 + \tan 1^{\circ})(1 + \tan 2^{\circ})(1 + \tan 3^{\circ})\ldots(1 + \tan {45}^{\circ})$. what is the value of X?
2D point projection on an ellipse
Concerning the proof of regularity of the weak solution for the laplacian problem given in Brezis
Characteristics in the theory of PDE's – What's Going On?

I am trying to understand the concept of clique graph. So I found this page. But I do not understand the example and what “graph intersection” is.

Can somebody explain to me why $K_4$ is a clique graph of $G$?

- Probability that an undirected graph has cycles
- Is there a monoid structure on the set of paths of a graph?
- 2 color theorem
- How would I find a minimum weight spanning tree for W?
- Is there an effective algorithm to solve this binary integer linear programming?
- How to draw that graph?

All I understand so far is that this particular graph $G$ has 4 cliques they are all $K_3$.

- Analogue of Fáry's theorem taking sphere and geodesics instead of plane and straight lines.
- Rank of an interesting matrix
- How many vertices do you need so that all squares are not directly connected?
- Exact probability of random graph being connected
- Probability of Selecting A Random Set in Graph with $k$ Edges That is Independent.
- Edge-coloring of bipartite graphs
- Graph theory (Graph Connectivity)
- Two disjoint spanning trees, spanning subgraph with all even degrees
- Random walk, Cat and mouse
- 3-regular graphs with no bridges

If we have some collection of sets, the intersection graph of the sets is given by representing each set by a vertex and then adding edges between any sets that share an element. (Wikipedia has a nice picture in the intersection graph article.)

The clique graph is the intersection graph of the maximal cliques.

As you note, $G$ has four maximal cliques.

Each of the four cliques shares at least one vertex with each of the other cliques, so in this case the intersection graph is complete.

Suppose you go through and circle all of the maximal cliques of G (which, as you noted, are all G_3s). These will be the vertices of the clique graph. When two (or more) circles overlap at a vertex in the original graph, those vertices will have an edge between them in the clique graph.

- Faithful functors from Rel, the category of sets and relations?
- Understanding how to evaluate $\lim_{x\to\frac\pi2} \frac{2^{-\cos x}-1}{x-\frac\pi2}$
- $\int_{\frac{1}{3}\pi}^{\frac{2}{3}\pi} {\sin(x)\;dx}$ using Riemann sums?
- $C$ with metric $d_2$ not complete
- How to find area under sines without calculus?
- Set of All Groups
- Proving and Modeling Logical Consistence
- What does $\binom{-n}{k}$ mean?
- Find the least number b for divisibility
- Arcwise connected part of $\mathbb R^2$
- $(-27)^{1/3}$ vs $\sqrt{-27}$.
- Suppose $|G| = 105$. Show that it is abelian if it has a normal $3$-Sylow subgroup.
- Derivative of Softmax loss function
- Why is the Laplacian important in Riemannian geometry?
- How to find the vertex of a 'non-standard' parabola? $ 9x^2-24xy+16y^2-20x-15y-60=0 $