How can I form in python this matrix to the corresponding graph?
$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
asked 11 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
asked 11 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
asked 11 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$
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
python graph
asked 11 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 11 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 11 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 11 mins ago
AIZEN_NEWAIZEN_NEW
1
asked 11 mins ago
AIZEN_NEWAIZEN_NEW
1
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.
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.
AIZEN_NEW is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
AIZEN_NEW is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215899%2fhow-can-i-form-in-python-this-matrix-to-the-corresponding-graph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
AIZEN_NEW is a new contributor. Be nice, and check out our Code of Conduct.
AIZEN_NEW is a new contributor. Be nice, and check out our Code of Conduct.
AIZEN_NEW is a new contributor. Be nice, and check out our Code of Conduct.
AIZEN_NEW is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215899%2fhow-can-i-form-in-python-this-matrix-to-the-corresponding-graph%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
