Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Dewar, Megan"'
Autor:
Dewar, Megan, Healy, John, Pérez-Giménez, Xavier, Prałat, Paweł, Proos, John, Reiniger, Benjamin, Ternovsky, Kirill
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach.
Externí odkaz:
http://arxiv.org/abs/1703.07686
Publikováno v:
Can. Math. Bull. 61 (2018) 252-271
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of Whitney fr
Externí odkaz:
http://arxiv.org/abs/1611.07087
In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play "Quad". We call this structure a binary Beckett-Gray code. We enumerate all codes for $n \leq 6$ and give examples for $n=7,8$. Beckett-Gray codes can be r
Externí odkaz:
http://arxiv.org/abs/1608.06001
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dewar, Megan, Healy, John, Pérez-Giménez, Xavier, Prałat, Paweł, Proos, John, Reiniger, Benjamin, Ternovsky, Kirill
Publikováno v:
Algorithms & Models for the Web Graph: 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14-15, 2016, Proceedings; 2016, p140-151, 12p
