4 papers
Elusive properties of countably infinite graphs
Márton Elekes, Tamás Kátay, Anett Kocsis
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine…
Compact Lie groups isolated up to conjugacy
Balázs Csikós, Tamás Kátay, Anett Kocsis +1
The set of compact subgroups of a Hausdorff topological group can be equipped with the Vietoris topology. A compact subgroup is isolated up…
Multiplicative complements I
Anett Kocsis, Dávid Matolcsi, Csaba Sándor +1
In this paper, we study how dense a multiplicative basis of order for can be, improving on earlier results. Upon introducing the notion of a \textit{multiplica…
Clique number of Xor products of Kneser graphs
András Imolay, Anett Kocsis, Ádám Schweitzer
In this article we investigate a problem in graph theory, which has an equivalent reformulation in extremal set theory similar to the problems researched in "A general 2-part Erdős…