Seminars
GALaC organizes or participates in three different regular seminars.
GALaC team seminar
The GALaC team seminar is organized on a regular basis on Friday at 14:00 in the PCRI building (650) at LISN. Recent and up-coming seminars
Plateau Saclay Combinatorics Seminar
The Plateau Saclay Combinatorics Seminar is held on several Mondays at 11am in room Philippe Flajolet (top floor on the left) at LIX. It is co-organized by the Combi team of LIX and the GALaC team. The mailing list for this seminar is combi_lix_lri@services.cnrs.fr. Subscribe to this ...
Plateau Saclay Algorithms Seminar
The Plateau Saclay Algorithms Seminar is held every other Friday afternoon in LIX. This working group is partially supported by Labex DigiCosme (Digital worlds: distributed data, programs and architectures). If you do wish (or not) to receive any emails from this seminar, you can subscribe or unsubscribe from the mailing ...
On the intervals of framing lattices
summary: A flow graph G is an acyclic oriented graph with \(V(G) = [n]\), \(E(G)\) a multi-set of edges where each edge \((i,j)\) satisfies \(i<j\), and such that \(G\) has a unique source \(s=1\) and sink \(t=n\). On such a graph, a route is simply ...
On the Structure of Potential Counterexamples to the Borodin-Kostochka Conjecture
summary: The Borodin-Kostochka conjecture, a long-standing problem in graph theory, asserts that every graph \(G\) with maximum degree \(\Delta \geq 9\) satisfies \(\chi(G) \leq max \{\Delta - 1, \omega(G)\}\) where \(\chi(G)\) and \(\omega(G)\) are respectively the chromatic number and the clique number of \(G\). While the conjecture ...
Excluding a rectangular grid
summary: For every positive integer k, we define the k-treedepth as the largest graph parameter td_k satisfying (i) td_k(∅)=0; (ii) td_k(G) <= 1+ td_k(G-u) for every graph G and every vertex u; and (iii) if G is a (
Translations: fr