Timeline for One part of a bipartite graph has max degree 3. Partition the other part to 3 ~equal subsets s.t. just a fraction of first part see all 3 subsets
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2020 at 14:59 | vote | accept | Ruhollah Majdoddin | ||
| May 6, 2020 at 14:59 | vote | accept | Ruhollah Majdoddin | ||
| May 6, 2020 at 14:59 | |||||
| May 4, 2020 at 13:21 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
added 5 characters in body
|
| May 4, 2020 at 7:16 | answer | added | DSM | timeline score: 1 | |
| May 3, 2020 at 15:42 | history | edited | Ruhollah Majdoddin |
edited tags
|
|
| May 3, 2020 at 13:49 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
added 18 characters in body
|
| May 3, 2020 at 13:25 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
edited title
|
| May 3, 2020 at 13:18 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
added 1051 characters in body
|
| May 3, 2020 at 13:10 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
added 1051 characters in body
|
| May 3, 2020 at 10:15 | answer | added | Tony Huynh | timeline score: 2 | |
| May 3, 2020 at 8:30 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
edited title
|
| May 3, 2020 at 7:46 | review | Close votes | |||
| May 18, 2020 at 3:06 | |||||
| May 3, 2020 at 7:29 | history | edited | Ruhollah Majdoddin | CC BY-SA 4.0 |
edited title
|
| May 3, 2020 at 7:25 | comment | added | Ruhollah Majdoddin | true, I need it for an algorithm, so I am interested in a sympathetic behaviour and roughly in almost would be enough. | |
| May 3, 2020 at 0:30 | comment | added | Gerry Myerson | Taking the question as in the title (so, without the roughly and the almost), this is clearly impossible for $K_{3,3}$. | |
| May 2, 2020 at 21:17 | history | asked | Ruhollah Majdoddin | CC BY-SA 4.0 |