Timeline for Injective edge choice functions in linear hypergraphs
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2019 at 12:09 | vote | accept | Dominic van der Zypen | ||
| May 16, 2019 at 10:19 | answer | added | LeechLattice | timeline score: 1 | |
| May 16, 2019 at 7:34 | comment | added | Dominic van der Zypen | Thanks - can you post this as an answer such that we can close this thread? | |
| May 16, 2019 at 2:51 | comment | added | LeechLattice | No, there's an affine plane on 9 points with 12 lines, and every line has length 3. | |
| May 15, 2019 at 17:55 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
more concise definition
|
| May 15, 2019 at 17:52 | comment | added | Dominic van der Zypen | You are right @PéterKomjáth! I should formulate this in a more elegant way. - An interesting subquestion is whether $|e|>2$ for all $e\in E$ implies $|E|\leq |V|$? | |
| May 15, 2019 at 15:26 | comment | added | Péter Komjáth | Maybe I misread something, but does 2. hold if $e\cap e_1=\emptyset$ anyway? So the question is if $H$ has a set of distinct representatives.Surely it does not, if $|E|>|V|$. | |
| May 15, 2019 at 9:14 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |