-
Ben Lund, Thresholds for incidence properties in finite vector spaces
Ben Lund, Thresholds for incidence properties in finite vector spaces
Suppose that
35 events found.
Seminars and Colloquiums
Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
1 event,
0 events,
1 event,
-
Jean-Florent Raymond, Long induced paths in minor-closed graph classes and beyond
Jean-Florent Raymond, Long induced paths in minor-closed graph classes and beyond
In 1982 Galvin, Rival, and Sands proved that in
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Younjin Kim (김연진), On the extremal problems related to Szemerédi’s theorem
Younjin Kim (김연진), On the extremal problems related to Szemerédi’s theorem
In 1975, Szemerédi proved that for every real number
0 events,
1 event,
-
Jakub Gajarský, Model Checking on Interpretations of Classes of Bounded Local Clique-Width
Jakub Gajarský, Model Checking on Interpretations of Classes of Bounded Local Clique-Width
The first-order model checking problem for finite graphs asks, given a graph G and a first-order sentence
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Boram Park (박보람), Odd coloring of sparse graphs
Boram Park (박보람), Odd coloring of sparse graphs
We introduce an odd coloring of a graph, which was introduced very recently, motivated by parity type colorings of graphs. A proper vertex coloring of graph
0 events,
1 event,
-
Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number
Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number
We prove that for every graph F with at least one edge there are graphs H of arbitrarily large chromatic number and the same clique number as F such that every F-free induced subgraph of H has chromatic number at most c=c(F). (Here a graph is F-free if it does not contain an induced copy …