ShakharSmorodinsky

Archive of posts with tag 'ShakharSmorodinsky'

  • Shakhar Smorodinsky, List coloring for geometric hypergraphs
    List coloring for geometric hypergraphs
    Shakhar Smorodinsky
    Department of Mathematics, Ben-Gurion University, Israel
    2010/9/17 Fri 3PM-4PM

    Given a hypergraph H = (V,E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex whose color is distinct from the colors of all other vertices in S. The study of this notion is motivated by frequency assignment problems in wireless networks. We introduce and study the list-coloring (or choice) version of this notion. Joint work with Panagiotis Cheilaris.

    Tags:

  • (Colloquium) Shakhar Smorodinsky, Conflict-Free colorings
    Conflict-Free colorings
    Shakhar Smorodinsky
    Department of Mathematics, Ben-Gurion University, Israel
    2010/9/16 Thu 4:30PM-5:30PM (Room 1501)</em>

    Given a hypergraph H = (V,E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex whose color is distinct from the colors of all other vertices in S. When all hyperedges in H have cardinality two (i.e., when H is a simple graph), this coloring coincides with the classical graph coloring. The study of this coloring is motivated by frequency assignment problems in wireless networks and several other applications. We will survey this notion and introduce some fascinating open problems.

    Tags:

Monthly Archives