Ttykuu

Echo with obfuscation

Does Doodling or Improvising on the Piano Have Any Benefits?

Unable to disable Microsoft Store in domain environment

Would this string work as string?

Is there a reason to prefer HFS+ over APFS for disk images in High Sierra and/or Mojave?

What is the meaning of the following sentence?

Can I run 125kHz RF circuit on a breadboard?

Difference between shutdown options

What does "tick" mean in this sentence?

Mimic lecturing on blackboard, facing audience

Do I have to take mana from my deck or hand when tapping a dual land?

Overlapping circles covering polygon

Usage of an old photo with expired copyright

What does "Scientists rise up against statistical significance" mean? (Comment in Nature)

Is there a RAID 0 Equivalent for RAM?

Why would five hundred and five be same as one?

Integral Notations in Quantum Mechanics

Giving feedback to someone without sounding prejudiced

How much do grades matter for a future academia position?

Typing CO_2 easily

Has the laser at Magurele, Romania reached a tenth of the Sun's power?

Why didn’t Eve recognize the little cockroach as a living organism?

Personal or impersonal in a technical resume

Can I say "fingers" when referring to toes?

How can I form in python this matrix to the corresponding graph?

Adjacency matrix on undirected graphFind a triangle in a graph represented as an adjacency listA graph representation of Adjacent Matrix in PythonPython graph challengeAdjacency List Graph representation on pythonHaskell - Adjacency MatrixGeneric Graph using Adjacency matrix - JavaPlayer Marking , Optimal Marking Using GraphImplement a graph in PythonGraph implementation in c++ using adjacency matrix

0

$begingroup$

im working in graph theory and sagemath or python.

for prove that R(3,3)=6 is necessary to find a counterexample of a graph where it has neither a triangle monochromatic red nor a K_3 blue, for this case, an adjacency matrix is designed with entries 1 and -1, where the entry in the matrix is 1 if the corresponding edge is red or -1 if the corresponding edge is blue, the main diagonal 0 since there are no edges.

I would like to know if it is possible to build the corresponding graph in sage with the adjacency matrix

Ex: part of the code says,

"""Subgraph"""

for k in range(2**10):
G=CrearMatriz(k,5)
if Encontrar_Subgrafo(G,3)==True:
 print (str(k)+ " Passed")
 k=k+1
else:
 print(k)
 U=CrearMatriz(k,5)
 print (U)
 break
print("Done")

where the counterexample is

 array([[ 0, -1, -1, 1, 1],
 [-1, 0, 1, -1, 1],
 [-1, 1, 0, 1, -1],
 [ 1, -1, 1, 0, -1],
 [ 1, 1, -1, -1, 0]])

How can I form in sage or python this matrix to the corresponding graph?

python graph

share

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

im working in graph theory and sagemath or python.

for prove that R(3,3)=6 is necessary to find a counterexample of a graph where it has neither a triangle monochromatic red nor a K_3 blue, for this case, an adjacency matrix is designed with entries 1 and -1, where the entry in the matrix is 1 if the corresponding edge is red or -1 if the corresponding edge is blue, the main diagonal 0 since there are no edges.

I would like to know if it is possible to build the corresponding graph in sage with the adjacency matrix

Ex: part of the code says,

"""Subgraph"""

for k in range(2**10):
G=CrearMatriz(k,5)
if Encontrar_Subgrafo(G,3)==True:
 print (str(k)+ " Passed")
 k=k+1
else:
 print(k)
 U=CrearMatriz(k,5)
 print (U)
 break
print("Done")

where the counterexample is

 array([[ 0, -1, -1, 1, 1],
 [-1, 0, 1, -1, 1],
 [-1, 1, 0, 1, -1],
 [ 1, -1, 1, 0, -1],
 [ 1, 1, -1, -1, 0]])

How can I form in sage or python this matrix to the corresponding graph?

python graph

share

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

im working in graph theory and sagemath or python.

for prove that R(3,3)=6 is necessary to find a counterexample of a graph where it has neither a triangle monochromatic red nor a K_3 blue, for this case, an adjacency matrix is designed with entries 1 and -1, where the entry in the matrix is 1 if the corresponding edge is red or -1 if the corresponding edge is blue, the main diagonal 0 since there are no edges.

I would like to know if it is possible to build the corresponding graph in sage with the adjacency matrix

Ex: part of the code says,

"""Subgraph"""

for k in range(2**10):
G=CrearMatriz(k,5)
if Encontrar_Subgrafo(G,3)==True:
 print (str(k)+ " Passed")
 k=k+1
else:
 print(k)
 U=CrearMatriz(k,5)
 print (U)
 break
print("Done")

where the counterexample is

 array([[ 0, -1, -1, 1, 1],
 [-1, 0, 1, -1, 1],
 [-1, 1, 0, 1, -1],
 [ 1, -1, 1, 0, -1],
 [ 1, 1, -1, -1, 0]])

How can I form in sage or python this matrix to the corresponding graph?

python graph

share

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

"""Subgraph"""

for k in range(2**10):
G=CrearMatriz(k,5)
if Encontrar_Subgrafo(G,3)==True:
 print (str(k)+ " Passed")
 k=k+1
else:
 print(k)
 U=CrearMatriz(k,5)
 print (U)
 break
print("Done")

 array([[ 0, -1, -1, 1, 1],
 [-1, 0, 1, -1, 1],
 [-1, 1, 0, 1, -1],
 [ 1, -1, 1, 0, -1],
 [ 1, 1, -1, -1, 0]])

share

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1

New contributor

AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 7 mins ago

AIZEN_NEWAIZEN_NEW

1