Tag - Graphs

JGA 2019
21ièmes Journées Graphes et Algorithmes (JGA 2019) Wed, Nov 13, 2019 11:00 CET (CONFIRMED)

Les 21ièmes Journées Graphes et Algorithmes (JGA 2019) auront lieu à Bruxelles, du 13 au 15 novembre 2019. Il s'agit du rendez-vous annuel de la communauté francophone de la théorie des graphes et de ses applications.

Fractional coloring with local demands Wed, Mar 27, 2019 12:30 CET

Speakers: Tom Kelly

In a fractional coloring, vertices of a graph are assigned subsets of the [0, 1]-interval such that adjacent vertices receive disjoint subsets. The fractional chromatic number of a graph is at most k if it admits a fractional coloring in which the amount of "color" assigned to each vertex is at least 1/k. We investigate fractional colorings where vertices "demand" different amounts of color, determined by local parameters such as the degree of a vertex.

Computing a maximum independent set in a graph embedded in a fixed surface when the odd cycle packing number is bounded Wed, Jan 16, 2019 12:30 CET

Speakers: Samuel Fiorini

Tomorrow Sam will tell us how to compute a maximum independent set in a graph embedded in a fixed surface if there are not many disjoint odd cycles in the graph. Note the unusual room: NO8.202 ("petit séminaire"), because of exams taking place in the other rooms.

Finding a Maximum-Weight Convex Set in a Chordal Graph Wed, Nov 21, 2018 12:30 CET

Speakers: Keno Merckx

Hypergraphic polytopes and flip graphs Wed, Nov 7, 2018 12:30 CET

Speakers: Jean Cardinal

Almost all string graphs are intersection graphs of plane convex sets Wed, Oct 10, 2018 12:30 CEST

Speakers: Yelena Yuditsky

Sparse Kneser graphs are hamiltonian Wed, Aug 29, 2018 12:30 CEST

Speakers: Bartosz Walczak

Dimension of posets whose cover graphs exclude some minor Wed, May 30, 2018 12:30 CEST

Speakers: Michal Seweryn

Homomorphism bounds for K4-minor-free graphs Tue, May 8, 2018 12:30 CEST

Speakers: Laurent Beaudou

Crossing Numbers Wed, Apr 25, 2018 12:30 CEST

Speakers: Torsten Ueckerdt