기초과학연구원 이산수학그룹
|
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
1 event,
-
In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
Configurations of axis-parallel boxes in |
0 events,
|
1 event,
-
We consider the spanning tree embedding problem in dense graphs without bipartite holes and sparse graphs. In 2005, Alon, Krivelevich and Sudakov asked for determining the best possible spectral gap forcing an |
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
Pivot-minors can be thought of as a dense analogue of graph minors. We shall discuss pivot-minors and two recent results for proper pivot-minor-closed classes of graphs. In particular, that for every graph H, the class of graphs containing no H-pivot-minor is 𝜒-bounded, and also satisfies the (strong) Erdős-Hajnal property. |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
Website: https://www.matrix-inst.org.au/events/structural-graph-theory-downunder-iii/ Program Description: This program, jointly organised by MATRIX and the Discrete Mathematics Group of the Korean Institute for Basic Science (IBS), builds on the “Structural Graph Theory Downunder” programs held at MATRIX in 2019 and 2022. In this short intensive workshop, mathematicians from across the globe will come together to work on open … |
2 events,
-
In 2006, Tao established the Gaussian counterpart of the celebrated Green-Tao theorem on arithmetic progressions of primes. In this talk, I will explain the extension of Tao's theorem and the Green-Tao theorem to the case of general number fields. Our combinatorial tool is the relative hypergraph removal lemma by Conlon-Fox-Zhao. I will discuss the difficulties … |
||||
|
1 event,
-
For a given graph |
0 events,
|
1 event,
-
In many different areas of mathematics (such as number theory, discrete geometry, and combinatorics), one is often presented with a large "unstructured" object, and asked to find a smaller "structured" object inside it. One of the earliest and most influential examples of this phenomenon was the theorem of Ramsey, proved in 1930, which states that … |
0 events,
|
0 events,
|
||
|
0 events,
|
0 events,
|
1 event,
-
The Ramsey number |
0 events,
|
0 events,
|
0 events,
|
0 events,
|