Timeline for Sets of spreads in graphs
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2015 at 23:35 | comment | added | Anurag | I have found a set of 200 pairwise disjoint spreads in McL. So $s_5(McL) \geq 200$. There might be a full resolution but I stopped my search at 200 as it seemed like it was taking too long. I can send you the SAGE code for this if you want. I used a rather brute force way of doing it using the inbuilt implementation of dancing links algorithm in SAGE. | |
| Jan 9, 2015 at 15:31 | comment | added | Anurag | @FelixGoldberg: It seems quite interesting to me. Have you tried to compute the five different spreads they mention in the paper? If you want then you can send more details about what you are working on and trying to achieve via email, [email protected]. | |
| Jan 9, 2015 at 11:02 | comment | added | Felix Goldberg | @Anurag I don't have an example - I am hoping to construct one for an argument I am working on. Haemers and Tonchev say in the paper that they found five different spreads but don't say whether those spreads were pairwise disjoint. If you are interested (I thought you might be :) I'll be happy to disucss this further. | |
| Jan 8, 2015 at 23:09 | comment | added | domotorp | Oh, yes, indeed. | |
| Jan 8, 2015 at 22:50 | comment | added | Felix Goldberg | @domotorp I think that I need Baranyai's conclusion but for other hypergraphs than the complete ones. | |
| Jan 8, 2015 at 22:46 | comment | added | domotorp | I might have misunderstood your question, but what you're asking isn't exactly en.wikipedia.org/wiki/Baranyai%27s_theorem ? | |
| Jan 8, 2015 at 22:44 | comment | added | Anurag | Why 7? Do you have an example of a partial 5-resolution of size 7 for McL? | |
| Jan 7, 2015 at 20:59 | history | edited | Felix Goldberg | CC BY-SA 3.0 |
added 1 character in body
|
| Jan 7, 2015 at 10:49 | history | asked | Felix Goldberg | CC BY-SA 3.0 |