What are the triangle free graphs on $lfloorfrac{n^2}{4}rfloor$ edges .
$begingroup$
I tried for $n=4$, it is a cycle of length $4$ which is $K_{2,2}$. $n=5$, it seems to be $K_{2,3}$. So my guess is it is a complete bipartite graph?
graph-theory
asked Dec 10 '18 at 15:51
user42493user42493
1928
$endgroup$
add a comment |
$begingroup$
I tried for $n=4$, it is a cycle of length $4$ which is $K_{2,2}$. $n=5$, it seems to be $K_{2,3}$. So my guess is it is a complete bipartite graph?
graph-theory
asked Dec 10 '18 at 15:51
user42493user42493
1928
$endgroup$
1
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08
add a comment |
$begingroup$
I tried for $n=4$, it is a cycle of length $4$ which is $K_{2,2}$. $n=5$, it seems to be $K_{2,3}$. So my guess is it is a complete bipartite graph?
graph-theory
asked Dec 10 '18 at 15:51
user42493user42493
1928
$endgroup$
I tried for $n=4$, it is a cycle of length $4$ which is $K_{2,2}$. $n=5$, it seems to be $K_{2,3}$. So my guess is it is a complete bipartite graph?
graph-theory
graph-theory
asked Dec 10 '18 at 15:51
user42493user42493
1928
asked Dec 10 '18 at 15:51
user42493user42493
1928
asked Dec 10 '18 at 15:51
user42493user42493
1928
asked Dec 10 '18 at 15:51
user42493user42493
1928
asked Dec 10 '18 at 15:51
user42493user42493
1928
1928
1
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08
add a comment |
1
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08
1
1
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is a partial case of Turán’s theorem for $r=2$. The unique (up to a isomorphism) edge-maximal triangle-free graph is a Turán graph, which is a complete bipartite graph on $n$ vertices such that the sizes of the parts differs by at most one.
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
$endgroup$
add a comment |
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.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3034086%2fwhat-are-the-triangle-free-graphs-on-lfloor-fracn24-rfloor-edges%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is a partial case of Turán’s theorem for $r=2$. The unique (up to a isomorphism) edge-maximal triangle-free graph is a Turán graph, which is a complete bipartite graph on $n$ vertices such that the sizes of the parts differs by at most one.
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
$endgroup$
add a comment |
$begingroup$
This is a partial case of Turán’s theorem for $r=2$. The unique (up to a isomorphism) edge-maximal triangle-free graph is a Turán graph, which is a complete bipartite graph on $n$ vertices such that the sizes of the parts differs by at most one.
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
$endgroup$
add a comment |
$begingroup$
This is a partial case of Turán’s theorem for $r=2$. The unique (up to a isomorphism) edge-maximal triangle-free graph is a Turán graph, which is a complete bipartite graph on $n$ vertices such that the sizes of the parts differs by at most one.
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
$endgroup$
This is a partial case of Turán’s theorem for $r=2$. The unique (up to a isomorphism) edge-maximal triangle-free graph is a Turán graph, which is a complete bipartite graph on $n$ vertices such that the sizes of the parts differs by at most one.
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
answered Dec 10 '18 at 18:33
Alex RavskyAlex Ravsky
42.7k32383
42.7k32383
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3034086%2fwhat-are-the-triangle-free-graphs-on-lfloor-fracn24-rfloor-edges%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
1
$begingroup$
That's a strong conjecture on slim evidence. Did you try $n=6$?
$endgroup$
– Lee Mosher
Dec 10 '18 at 15:59
$begingroup$
$K_{3,3}$ has 9 edges
$endgroup$
– user42493
Dec 10 '18 at 16:35
$begingroup$
A bipartite graph is triangle-free, so it's easy to find complete bipartite graphs that satisfy the requirement. The difficulty would be in showing these are the only examples (if that's true.)
$endgroup$
– saulspatz
Dec 10 '18 at 16:36
$begingroup$
I went through the graph on 6 vertices on this link: graphclasses.org/smallgraphs.html#nodes6 and did not find any . I don't know if the list is complete as I didn't find $k_{3,3}$. I couldn't find a good one for 7 vertices either.
$endgroup$
– user42493
Dec 10 '18 at 17:08