| Saturday 10 May 2025 | |
| Events for day: Wednesday 07 May 2025 |
| 14:00 - 15:00 Combinatorics and Computing Weekly Seminar Balanced Coloring of signed Graphs and signed Hadwiger Conjecture School MATHEMATICS A signed graph (G, σ) is a graph together with an assignment σ which assigns a sign (positive or negative) to each edge. Sign of a cycle in (G, σ) is the product of signs of its edges. A subset of vertices is said to be balanced if it induces no negative cycle. The balanced chromatic number of a signed graph is the minimum number of balanced sets that covers all vertices of (G, σ). The parameter is studied under various equivalent terms. In this talk, after presenting some basic properties of balanced coloring and balanced chromatic number, we will have a look at how structural conditions, such as forb ... |