Birs- 18w5050: Symmetry Breaking in Discrete Structures

  1. Title:
    Symmetry Breaking

    Speaker:

    Link:

  2. Title:
    Distinguishing numbers of infinite graphs with bounded degrees

    Speaker:

    Link:

  3. Title:
    Distinguishing number of vertex-transitive graphs of valency 4

    Speaker:

    Link:

  4. Title:
    Bounds for the distinguishing index of finite graphs

    Speaker:

    Link:

  5. Title:
    Distinguishing vertices of a graph: automorphisms and palettes

    Speaker:

    Link:

  6. Title:
    The number of different distinguishing colorings of a graph

    Speaker:

    Link:

  7. Title:
    Symmetry breaking in maximal outerplanar, regular and Cayley graphs

    Speaker:

    Link:

  8. Title:
    My view on symmetry breaking, part 1

    Speaker:

    Link:

  9. Title:
    Symmetry breaking - my view, part 2

    Speaker:

    Link:

  10. Title:
    Efficient symmetry breaking for graphs via coherent configurations: the emergence of the Johnson graphs

    Speaker:

    Link:

  11. Title:
    Minimal degree of the automorphism group of primitive coherent configurations

    Speaker:

    Link:

  12. Title:
    The Sun--Wilmes classification of primitive coherent configurations with many automorphisms

    Speaker:

    Link:

  13. Title:
    Symmetry Breaking of Countable Homogeneous Structures

    Speaker:

    Link:

  14. Title:
    The costs of symmetry breaking vertex-transitive cubic graphs

    Speaker:

    Link:

  15. Title:
    Distinguishing Sierpiński products of graphs

    Speaker:

    Link:

  16. Title:
    Bounds and invariants of semiprimitive groups

    Speaker:

    Link:

  17. Title:
    The distinguishing number of semiprimitive groups

    Speaker:

    Link:

  18. Title:
    Distinguishing partitions and asymmetric uniform hypergraphs

    Speaker:

    Link:

  19. Title:
    The Distinguishing Number and Posets, Part I

    Speaker:

    Link:

  20. Title:
    The Distinguishing Number and Posets, Part II

    Speaker:

    Link: