Showing math.COShow all
2 papers · 1 filter
math.CO2025
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…
math.CO2021
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…