Timeline for Minimality condition in a certain class of hypergraphs
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2015 at 15:30 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
Answer is YES (not NO). But everything (but for this "yes/no") seems fine.
|
| Jan 12, 2015 at 12:58 | vote | accept | Dominic van der Zypen | ||
| Jan 12, 2015 at 12:58 | comment | added | Dominic van der Zypen | Very nice example - thanks Wlodzimierz! | |
| Jan 12, 2015 at 12:23 | history | edited | Włodzimierz Holsztyński | CC BY-SA 3.0 |
REMARK about a virtue of the given example.
|
| Jan 12, 2015 at 12:20 | comment | added | Włodzimierz Holsztyński | It seems to me that flag complexes are in a 1-1 canonical correspondence with the (possibly infinite) graphs $\ (V\ \binom V2).\ $ The flags (hypergraph edges) correspond to cliques, and maximal flags to maximal cliques. | |
| Jan 12, 2015 at 12:11 | history | answered | Włodzimierz Holsztyński | CC BY-SA 3.0 |