Related papers: Realizability of hypergraphs and intrinsic link th…

We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen's obstruction…

In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…

Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive…

Dirac (1952) proved that every connected graph of order $n>2k+1$ with minimum degree more than $k$ contains a path of length at least $2k+1$. Erd\H{o}s and Gallai (1959) showed that every $n$-vertex graph $G$ with average degree more than…

Our main theorem characterizes the complete intersections of codimension 2 in a projective space of dimension 3 or more over an algebraically closed field of characteristic 0 as the subcanonical and self-linked subschemes. In order to prove…

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^n$. Very often, the input graph is labeled by the user in an arbitrary and easy-to-use way, and the data structure for the graph…

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

In a metric space $M=(X,d)$, we say that $v$ is between $u$ and $w$ if $d(u,w)=d(u,v)+d(v,w)$. Taking all triples $\{u,v,w\}$ such that $v$ is between $u$ and $w$, one can associate a 3-uniform hypergraph with each finite metric space $M$.…

In recent years we have learned that several four-dimensional field theories can manifest non-invertible zero-form symmetries generalizing the Kramers-Wannier duality defect of the 2d critical Ising model. Several recent works by various…

A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this problem in the random case and show that a random integer…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

I review some recent results on four-manifold invariants which have been obtained in the context of topological quantum field theory. I focus on three different aspects: (a) the computation of correlation functions, which give explicit…

Three dimensional SU(2) Chern-Simons theory has been studied as a topological field theory to provide a field theoretic description of knots and links in three dimensions. A systematic method has been developed to obtain the link-invariants…

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

We obtain new invariants of topological link concordance and homology cobordism of 3-manifolds from Hirzebruch-type intersection form defects of towers of iterated p-covers. Our invariants can extract geometric information from an arbitrary…

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

Various recently developed connections between supersymmetric Yang-Mills theories in four dimensions and two dimensional integrable systems serve as crucial ingredients in improving our understanding of the AdS/CFT correspondence. In this…