Ahmed Ghazy and Tim Hartmann, Continuous Graphs – An Overview and a Coloring Problem
We consider a continuous model of graphs, introduced by Dearing and Francis in 1974, where each edge of G to be a unit interval, giving rise to an infinite metric …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
Simón Piga, Turán problem in hypergraphs with quasirandom links
Room B332 IBS (기초과학연구원)Given a $k$-uniform hypergraph $F$, its Turán density $\pi(F)$ is the infimum over all $d\in $ such that any $n$-vertex $k$-uniform hypergraph $H$ with at least $d\binom{n}{k}+o(n^k)$ edges contains a …
-
Fedor Noskov, Polynomial dependencies in hypergraph Turan-type problems
Room B332 IBS (기초과학연구원)Consider a general Turan-type problem on hypergraphs. Let $\mathcal{F}$ be a family of $k$-subsets of $$ that does not contain sets $F_1, \ldots, F_s$ satisfying some property $P$. We show …
-
Péter Pál Pach, Product representation of perfect cubes
Room B332 IBS (기초과학연구원)Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq $ such that the equation \ has no solution with $a_1,a_2,\ldots,a_k\in A$ and integer $x$. Erdős, Sárközy and T. Sós …
-
5th East Asia Workshop on Extremal and Structural Graph Theory
Seoul, KoreaThe 5th East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the …
-
-
Matthew Kwan, Exponential anticoncentration of the permanent
Room B332 IBS (기초과학연구원)Let A be a random n×n matrix with independent entries, and suppose that the entries are “uniformly anticoncentrated” (for example, A could be a uniformly random n×n matrix with ±1 …
-
Tuukka Korhonen, Dynamic Treewidth in Logarithmic Time
Room B332 IBS (기초과학연구원)We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge …
-
Chi Hoi Yip, Cliques in Paley graphs and cyclotomic graphs
Room B332 IBS (기초과학연구원)Given a prime power $q \equiv 1 \pmod 4$, the Paley graph of order $q$ is the graph defined over $\mathbb{F}_q$ (the finite field with $q$ elements), such that two …
-
Donggyu Kim (김동규), Grassmann-Plücker functions for orthogonal matroids
Room B332 IBS (기초과학연구원)We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann-Plücker functions. The equivalence is motivated by Cayley's identities expressing principal and almost-principal minors of a skew-symmetric matrix …
-
Yunbum Kook (국윤범), Sampling and volume computation
Room B332 IBS (기초과학연구원)Since the development of the first randomized polynomial-time algorithm for volume computation by Dyer, Frieze, and Kannan in 1989, convex-body sampling has been a central problem at the intersection of …