17 citations · 61 across the 21 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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…
math.CO2007
Cutsets in infinite graphs
Adam Timar
We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter for Cayley graphs that has significant application to percolation. For a m…