Tuan Anh Do, Rank- and tree-width of supercritical random graphs
Room B232 IBS (기초과학연구원)It is known that the rank- and tree-width of the random graph
10 events found.
MATRIX-IBS Workshop: Structural Graph Theory Downunder II
MATRIX, AustraliaThis program consists of a short intensive workshop, where mathematicians from across the globe will come together to work on open problems in structural graph theory. We will consider the following research themes: graph minors, graph colouring, Hadwiger’s Conjecture, bounded expansion classes, graph product structure theory, generalised colouring numbers, VC dimension, induced subgraphs, Erdős-Hajnal conjecture, …
Jaehoon Kim (김재훈), Ramsey numbers of cycles versus general graphs
Room B232 IBS (기초과학연구원)The Ramsey number
Ben Lund, Thresholds for incidence properties in finite vector spaces
Room B232 IBS (기초과학연구원)Suppose that
Jean-Florent Raymond, Long induced paths in minor-closed graph classes and beyond
Zoom ID: 869 4632 6610 (ibsdimag)In 1982 Galvin, Rival, and Sands proved that in
IBS ECOPRO Opening conference
Zoom ID: 878 0445 3986 (ibsecopro) [CLOSED]To celebrate the opening of the IBS ECOPRO (Extremal Combinatorics and Probability) Group, we will organize a 3-day online conference from April 4 to April 6. Official Website: https://www.ibs.re.kr/ecopro/event/opening/ Invited Speakers Noga Alon Princeton University József Balogh University of Illinois at Urbana-Champaign Jeff Kahn Rutgers University Mihyun Kang Graz University of Technology Jeong Han Kim …
Younjin Kim (김연진), On the extremal problems related to Szemerédi’s theorem
Room B232 IBS (기초과학연구원)In 1975, Szemerédi proved that for every real number
Jakub Gajarský, Model Checking on Interpretations of Classes of Bounded Local Clique-Width
Zoom ID: 869 4632 6610 (ibsdimag)The first-order model checking problem for finite graphs asks, given a graph G and a first-order sentence
Boram Park (박보람), Odd coloring of sparse graphs
Room B232 IBS (기초과학연구원)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
Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number
Zoom ID: 869 4632 6610 (ibsdimag)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 …