Seminar za diskretno matematiko

Tedenski povzetek

• Splošno

  Skrči vse Razširi vse
  • 

    Forum novic

• 22. november - 28. november
  • Jelena Sedlar: Remarks on the local irregularity conjecture

  • Tuesday, November 23rd, at 10:15
    

  • 

    Abstract. Datoteka

• 29. november - 5. december
  • Sergio Cabello
    

  • Tuesday, November 30th, at 10:15
    

• 6. december - 12. december
  • Snježana Majstorović
    

  • Tuesday, December 7th, at 10:15
    

• 13. december - 19. december
  • 2021 Symposium on Modern Graph Theory
    

  • Monday, December 13th - Friday, December 17th
    

    
    

    
    

• 20. december - 27. december
  • Bojan Mohar
    

  • Tuesday, December 21st, at 10:15
    

• 27. december - 2. januar

• 3. januar - 9. januar

• 10. januar - 16. januar

• 17. januar - 23. januar

• 24. januar - 30. januar

• 31. januar - 6. februar

• 7. februar - 13. februar

• 14. februar - 20. februar

• 21. februar - 27. februar

• 28. februar - 6. marec

• 7. marec - 13. marec

• 14. marec - 20. marec

• 21. marec - 26. marec

  Sandi Klavžar: Mutual-visibility in graphs

• 28. marec - 3. april

  Sandi Klavžar: Mutual-visibility in graphs II
  

• 4. april - 10. april

  Monika Pilśniak: Proper distinguishing arc-colourings of symmetric digraphs

   Abstract:

  A symmetric digraph $\overleftrightarrow{G}$ arises from a simple graph $G$ by substituting each edge $uv$ by a pair of opposite arcs $\overrightarrow{uv}, \overrightarrow{vu}$. An arc-colouring $c$ of $\overleftrightarrow{G}$ is distinguishing if the only automorphism of $\overleftrightarrow{G}$ preserving $c$ is the identity. We study distinct types of proper arc-colourings of $\overleftrightarrow{G}$ corresponding to four definitions of adjacency of arcs. For each type, we investigate the distinguishing chromatic index of $\overleftrightarrow{G}$, i.e. the least number of colours in a distinguishing proper colouring of $\overleftrightarrow{G}$. We also determine tight bounds for chromatic indices of $\overleftrightarrow{G}$, i.e. for the least numbers of colours in each type of proper colourings.

   

  
  

• 11. april - 17. april

  Gašper Domen Romih: Cut method for hypertrees

  We investigate the cut method for calculating Wiener index of hypergraphs or more precisley tree hypergraphs. Motivation and some basic results will be presented.
  

• 18. april - 24. april

  Mike Henning: Bounds on domination parameters in graphs: a brief survey

  In this talk we present a brief survey of bounds on the (total) domination number of a graph in terms of its order and minimum degree.
  

• 25. april - 1. maj

• 2. maj - 8. maj

• 9. maj - 15. maj

  Mike Henning: Bounds on domination parameters in graphs: a brief survey

  
  

  Abstract: In this talk we present a brief survey of bounds on the domination number of a graph in terms of its order and minimum degree.

• 16. maj - 22. maj

  ??
  

• 23. maj - 29. maj

  Antonio Montero

  
  

• 30. maj - 5. junij

  Bojan Mohar
  

• 6. junij - 12. junij

• 13. junij - 19. junij

• 20. junij - 26. junij