Skip to main content
Correcting typo, and deleting "thanks", while this is on the front page
Source Link
LSpice
  • 12.9k
  • 4
  • 45
  • 69

Consider the alternating group graph, here defined as a Cayley graph on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$$\{(1,2,3),(1,2,4),\dotsc,(1,2,n),(1,n,2),\dotsc,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$  (this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\dotsc,(1,2,n),(1,n,2),\dotsc,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$  (this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints?

deleted 6 characters in body
Source Link
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22

Consider the alternating group graph, here defined as a Cayley graph using on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph using on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

fixed spelling
Source Link
YCor
  • 63.9k
  • 5
  • 187
  • 286

Consider the alternating group graph, here defined as a Cayley graph using on the Alternatingalternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result uptoup to $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph using on the Alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result upto $A_6$. Any hints? Thanks beforehand.

Consider the alternating group graph, here defined as a Cayley graph using on the alternating group $A_n$ using the generating set $\{(1,2,3),(1,2,4),\ldots,(1,2,n),(1,n,2),\ldots,(1,4,2),(1,3,2)\}$. Note that when $n=3$, the graph reduces to a triangle.

Observing that the clique size is just $3$(this can be seen by observing the structure around the identity), I propose that the graph is properly $3$-colorable for all $n$. But, can this be proved? I suppose using left cosets of $A_3$ with respect to $A_n$ would help us here. In fact, it helped in getting $3$-coloring for $A_4$. Whereas, I am struck even for $A_5$. The SageMath software gives me the expected result up to $A_6$. Any hints? Thanks beforehand.

added 9 characters in body
Source Link
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22
Loading
Source Link
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22
Loading