17 citations · 61 across the 21 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011
Split hypergraphs
Adam Timar
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraph…
math.CO2011
Approximating Cayley diagrams versus Cayley graphs
Adam Timar
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A s…