Timeline for List of counting proofs instead of linear algebra method in combinatorics
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2021 at 20:51 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 4 characters in body
|
| Feb 12, 2016 at 12:32 | comment | added | Fedor Petrov | Possibly. I have to look into at least. | |
| Feb 12, 2016 at 12:23 | comment | added | domotorp | Nice! Then could you redo the entire Babai-Frankl book in a similar fashion? | |
| Feb 12, 2016 at 8:38 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 907 characters in body
|
| Feb 12, 2016 at 6:03 | comment | added | Fedor Petrov | Yes, take usual proof and insert the proof of linear dependence of $n+1$ vectors in ${\mathbb F}_2^n$ by the above counting argument. | |
| Feb 12, 2016 at 6:01 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 370 characters in body
|
| Feb 12, 2016 at 1:35 | comment | added | domotorp | So, do you have a proof of the Oddtown thm then? | |
| Feb 11, 2016 at 21:51 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 25 characters in body
|
| Feb 11, 2016 at 21:43 | history | answered | Fedor Petrov | CC BY-SA 3.0 |