Timeline for Maximum sizes of independent sets in (non-uniform) hypergraphs
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2023 at 8:28 | comment | added | Johnny Cage | Thanks: I want to know what is known whenever we have very weak conditions on our hypergraph. Spencer's result is a very basic one, which needs essentially nothing to our hypergraph, but my impression is that one could improve it with some more sofisticated probabilistic argument. | |
| Sep 29, 2023 at 17:08 | comment | added | Boris Bukh | You should explain what you are trying to do. As stated, the only thing that one can say is that there is a huge literature about independent sets in hypergraphs, and what you want is somewhere in that literature. | |
| Sep 29, 2023 at 14:26 | history | edited | LSpice | CC BY-SA 4.0 |
Proofreading; Turan -> Turán; link to article
|
| Sep 29, 2023 at 11:30 | history | asked | Johnny Cage | CC BY-SA 4.0 |