Timeline for Graphs constructed from sums of perfect matchings
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2022 at 11:02 | answer | added | Susane Calegari | timeline score: 2 | |
| S Mar 16, 2022 at 21:05 | history | bounty ended | CommunityBot | ||
| S Mar 16, 2022 at 21:05 | history | notice removed | CommunityBot | ||
| Mar 14, 2022 at 17:33 | comment | added | Louis D | @BrendanMcKay True. But I meant it in the sense that if the OP views it as a multigraph, it may help lead to some relevant literature. Basically, given a multigraph you can decide to only view the underlying graph, but not the other way around; so there may be some benefit to temporarily thinking of it as a multigraph. | |
| Mar 14, 2022 at 12:18 | comment | added | Brendan McKay | @LouisD The OP just wrote union, not multiset union, so I don't think multigraphs were intended. I could be wrong. | |
| Mar 14, 2022 at 7:49 | answer | added | Aaron Meyerowitz | timeline score: 1 | |
| Mar 9, 2022 at 20:00 | comment | added | Louis D | Another trivial thing is that these are 1-factorable multigraphs (that is multigraphs which can be decomposed into perfect matchings), hence regular multigraphs. A google search for 1-factorable multigraphs will turn up some papers using this language. Note that not every regular multigraph is 1-factorable though. | |
| S Mar 8, 2022 at 18:19 | history | bounty started | Michał Oszmaniec | ||
| S Mar 8, 2022 at 18:19 | history | notice added | Michał Oszmaniec | Authoritative reference needed | |
| Mar 7, 2022 at 0:52 | comment | added | Brendan McKay | One trivial thing is that these graphs are $k$-edge-colourable. | |
| S Mar 6, 2022 at 13:43 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
minor typos corrected, expanded link (automatically) to its title instead of hyperlinking the word “this”, no need to add tag name to the title as well
|
| Mar 6, 2022 at 11:05 | review | Suggested edits | |||
| S Mar 6, 2022 at 13:43 | |||||
| Mar 6, 2022 at 9:45 | history | asked | Michał Oszmaniec | CC BY-SA 4.0 |