2 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Using the KKM theorem
Daniel McGinnis, Shira Zerbib
The KKM theorem, due to Knaster, Kuratowski, and Mazurkiewicz in 1929, is a fundamental result in fixed-point theory, which has seen numerous extensions and applications. In this p…
Generalized Ramsey numbers of cycles, paths, and hypergraphs
Deepak Bal, Patrick Bennett, Emily Heath +1
Given a -uniform hypergraph and a set of -uniform hypergraphs , the generalized Ramsey number is the minimum number of colors needed to…
Graphs with no even holes and no sector wheels are the union of two chordal graphs
Tara Abrishami, Eli Berger, Maria Chudnovsky +1
Sivaraman conjectured that if is a graph with no induced even cycle then there exist sets satisfying such that the induced graph…
Edge-coloring a graph so that every copy of a graph has an odd color class
Patrick Bennett, Emily Heath, Shira Zerbib
Recently, Alon introduced the notion of an -code for a graph : a collection of graphs on vertex set is an -code if it contains no two members whose symmetric differe…
Fractional covers and matchings in families of weighted -intervals
Ron Aharoni, Tomas Kaiser, Shira Zerbib
A -{\em interval} is a union of at most disjoint closed intervals on a fixed line. Tardos [Combinatorica 15 (1995), 123-134] and the second author [Disc. Comput. Geom. 18 (1…