Timeline for Generalization of Marshall Hall's Theorem to non-simple bipartite graphs
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2021 at 1:25 | answer | added | Tony Huynh | timeline score: 1 | |
| Aug 17, 2021 at 2:46 | comment | added | Tony Huynh | What does 'a finite number of special infinite families of graphs' mean exactly? For example, the cycle with $2n$ vertices and parallel classes of size $\frac{d}{2}$ is $d$-regular and has exactly $\frac{d^n}{2^{n-1}}$ perfect matchings. This is less than $d!$ for $d$ sufficiently large compared to $n$. | |
| Aug 17, 2021 at 2:27 | history | edited | bof | CC BY-SA 4.0 |
added 4 characters in body
|
| Aug 16, 2021 at 20:26 | history | edited | Sanket Biswas | CC BY-SA 4.0 |
added 31 characters in body
|
| Aug 16, 2021 at 20:17 | history | edited | Sanket Biswas | CC BY-SA 4.0 |
added 9 characters in body
|
| Aug 16, 2021 at 18:20 | history | edited | YCor |
edited tags
|
|
| Aug 16, 2021 at 12:46 | history | edited | Jeremy Rickard | CC BY-SA 4.0 |
edited title
|
| Aug 16, 2021 at 12:38 | history | asked | Sanket Biswas | CC BY-SA 4.0 |