Timeline for Minimal dominating sets in thin hypergraphs
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25 at 6:33 | vote | accept | Dominic van der Zypen | ||
| Sep 24 at 14:02 | comment | added | Ilya Bogdanov | Now it seems to be an answer to the question as asked. | |
| Sep 24 at 14:01 | history | edited | Ilya Bogdanov | CC BY-SA 4.0 |
deleted 500 characters in body
|
| Sep 24 at 13:43 | history | edited | Ilya Bogdanov | CC BY-SA 4.0 |
added 708 characters in body
|
| S Sep 24 at 12:56 | history | suggested | CommunityBot | CC BY-SA 4.0 |
Disclaimer about a wrong answer is added.
|
| Sep 24 at 12:54 | review | Suggested edits | |||
| S Sep 24 at 12:56 | |||||
| Sep 24 at 10:53 | comment | added | Peter Taylor | It seems to be equivalent to e.g. definition 1.2 of Acharya, B. D. (2007). Domination in hypergraphs. AKCE International Journal of Graphs and Combinatorics, 4(2), 117-126. | |
| Sep 24 at 10:30 | comment | added | Ilya Bogdanov | Eh… Seems that I really misread the question, but then this is really not the usual definition… | |
| Sep 24 at 10:15 | comment | added | Peter Taylor | Are you using a different definition of dominating? I don't see how $\bigcup \{e\in E:e\cap D \neq \emptyset\} = V$ requires $\{e\in E:e\cap D \neq \emptyset\} = E$ as you claim. | |
| Sep 24 at 10:01 | comment | added | Ilya Bogdanov | @PeterTaylor you need all edges to be pierced by the dominating set. So the dominating set should contain arbitrarily large numbers… | |
| Sep 24 at 9:57 | comment | added | Peter Taylor | Isn't that dominated by any singleton, because all singletons have non-empty intersection with $e_1 = V$? | |
| Sep 24 at 9:54 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |