-
Jang Soo Kim (김장수), Longest elements in a semigroup of functions and Slater indices
Jang Soo Kim (김장수), Longest elements in a semigroup of functions and Slater indices
The group
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,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Jungho Ahn (안정호), A coarse Erdős-Pósa theorem for constrained cycles
Jungho Ahn (안정호), A coarse Erdős-Pósa theorem for constrained cycles
An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem shows that for every positive integer
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
O-joung Kwon (권오정), Erdős-Pósa property of A-paths in unoriented group-labelled graphs
O-joung Kwon (권오정), Erdős-Pósa property of A-paths in unoriented group-labelled graphs
A family
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Sepehr Hajebi, The pathwidth theorem for induced subgraphs
Sepehr Hajebi, The pathwidth theorem for induced subgraphs
We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H, every graph of sufficiently large pathwidth contains either a large complete subgraph, a large complete bipartite induced minor, or an induced minor isomorphic to H. The …