How close are the width parameters of a plane graph and its (geometric) dual? Research motivated by this question, known as the self-duality of width parameters, originated from the seminal work by Robertson and Seymour. In this talk, we focus on the self-duality of pathwidth and present new results for polyhedral embeddings (a generalization of …
Discrete Math Seminar
Events
Calendar of Events
|
Sunday
|
Monday
|
Tuesday
|
Wednesday
|
Thursday
|
Friday
|
Saturday
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
1 event,
-
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform refinement of any given graph, we show that asymptotically almost-surely (a.a.s.) its exterior algebraic shifting is an explicit shifted graph depending only on the number of vertices and the Betti … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
A graph H is said to be positive if its homomorphism density tH(W) is non-negative for every bounded symmetric measurable function W:2 → ℝ. Antolín Camarena, Csóka, Hubai, Lippner and Lovász conjectured that a graph is positive if and only if it can be obtained by gluing two copies of the same graph along an … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
The codegree Turán density γ(F) of a k-uniform hypergraph F is the smallest γ ≥ 0 with the following property: if every set of k−1 vertices in an n-vertex k-uniform hypergraph H lies in at least (γ+o(1))n edges, then H contains a copy of F for all sufficiently large n. Piga, Sanhueza-Matamala, and Schacht proved … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has nearly optimal dependence on $\varepsilon$ under SH. For any fixed dimension $d\geq 2$ and for any $\varepsilon>0$ our randomized algorithm gives a $(1+\varepsilon)$-approximation in time $2^{O(1/\varepsilon^{d-1})}n^{1+o(1)}$. We also provide an algorithm for the hyperbolic Steiner tree problem with the same running … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|

