-
Ringi Kim (김린기), The strong clique number of graphs with forbidden cycles
Ringi Kim (김린기), The strong clique number of graphs with forbidden cycles
The strong clique number of a graph
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,
-
Pascal Gollin, Disjoint dijoins for classes of dibonds in finite and infinite digraphs
Pascal Gollin, Disjoint dijoins for classes of dibonds in finite and infinite digraphs
A dibond in a directed graph is a bond (i.e. a minimal non-empty cut) for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals the maximum …
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Sang-il Oum (엄상일), Survey on vertex-minors
Sang-il Oum (엄상일), Survey on vertex-minors
For a vertex v of a graph G, the local complementation at v is an operation to obtain a new graph denoted by G*v from G such that two distinct vertices x, y are adjacent in G*v if and only if both x, y are neighbors of v and x, y are non-adjacent, or at least one …
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Given a graph