Timeline for Minimum number of independent pairs in a matroid
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2020 at 6:21 | vote | accept | TZM | ||
| Oct 22, 2020 at 6:18 | comment | added | Tony Huynh | The Matroid Partition Theorem should be in most matroid theory texts (for example Oxley's book). It also follows immediately from the Matroid Intersection Theorem. I don't have it in front of me, but I think Schrijver's encyclopedic Combinatorial Optimization has references for who first proved all these things. | |
| Oct 22, 2020 at 4:25 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 10 characters in body
|
| Oct 22, 2020 at 3:37 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 1862 characters in body
|
| Oct 21, 2020 at 15:07 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 20 characters in body
|
| Oct 21, 2020 at 14:47 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 1 character in body
|
| Oct 21, 2020 at 14:42 | history | edited | Tony Huynh | CC BY-SA 4.0 |
deleted 1 character in body
|
| Oct 21, 2020 at 14:35 | history | edited | Tony Huynh | CC BY-SA 4.0 |
deleted 1 character in body
|
| Oct 21, 2020 at 14:34 | comment | added | Tony Huynh | Thanks. I +1ed your answer. Since you deleted your answer, I edited the first part of your answer in. | |
| Oct 21, 2020 at 14:29 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 8 characters in body
|
| Oct 21, 2020 at 14:28 | comment | added | Geva Yashfe | Yours is superior - mine had the same idea with an unnecessary complication. | |
| Oct 21, 2020 at 14:26 | history | answered | Tony Huynh | CC BY-SA 4.0 |