-
Casey Tompkins, On graphs without cycles of length 0 modulo 4
Casey Tompkins, On graphs without cycles of length 0 modulo 4
Bollobás proved that for every
35 events found.
Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Eero Räty, Positive discrepancy, MaxCut and eigenvalues of graphs
Eero Räty, Positive discrepancy, MaxCut and eigenvalues of graphs
The positive discrepancy of a graph
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Magnus Wahlström, Algorithmic aspects of linear delta-matroids
Magnus Wahlström, Algorithmic aspects of linear delta-matroids
Delta-matroids are a generalization of matroids with connections to many parts of graph theory and combinatorics (such as matching theory and the structure of topological graph embeddings). Formally, a delta-matroid is a pair
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Víctor Dalmau, Right-adjoints of Datalog Programs
Víctor Dalmau, Right-adjoints of Datalog Programs
We say that two functors Λ and Γ between thin categories of relational structures are adjoint if for all structures A and B, we have that Λ(A) maps homomorphically to B if and only if A maps homomorphically to Γ(B). If this is the case Λ is called the left adjoint to Γ and Γ …
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Maximilian Gorsky, Towards the half-integral Erdős-Pósa property for even dicycles
Maximilian Gorsky, Towards the half-integral Erdős-Pósa property for even dicycles
A family