English
Related papers

Related papers: Edge partitions of the complete graph and a determ…

200 papers

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…

Geometric Topology · Mathematics 2014-09-11 Dongseok Kim

In 2006, Barat and Thomassen conjectured in 2006 that the edges of every planar 4-regular 4-edge-connected graph can be decomposed into copies of the star with 3 leaves. Shortly afterward, Lai constructed a counterexample to this…

Combinatorics · Mathematics 2018-04-02 Michelle Delcourt , Luke Postle

We propose a way to derive polynomial invariants of closed, orientable $3$-manifolds from Heegaard diagrams via cellularly embedded graphs. Given a Heegaard diagram of an irreducible $3$-manifold $M$, we associate a Heegaard graph $G\subset…

Suppose that $\Gamma=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$…

Spectral Theory · Mathematics 2023-02-02 Cosmas Kravaris

The purpose of this short note is to study dominant rational maps from punctual Hilbert schemes of length $k>1$ of projective K3 surfaces $S$ containing infinitely many rational curves. Precisely, we prove that their image is necessarily…

Algebraic Geometry · Mathematics 2016-06-14 Hsueh-Yung Lin

The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

In 1972, Kotzig proved that for every even $n$, the complete graph $K_n$ can be decomposed into $\lceil\log_2n\rceil$ edge-disjoint regular bipartite spanning subgraphs, which is best possible. In this paper, we study regular bipartite…

Combinatorics · Mathematics 2024-10-18 Asaf Ferber , Bryce Frederickson , Dingjia Mao , Liana Yepremyan , Yizhe Zhu

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

Combinatorics · Mathematics 2018-03-21 Julien Bensmail , Jakub Przybyło

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Combinatorics · Mathematics 2019-12-19 Jakub Przybyło

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

Statistical Mechanics · Physics 2011-11-16 E. Ben-Naim , P. L. Krapivsky

We consider a statistical problem to estimate variables (effects) that are associated with the edges of a complete bipartite graph $K_{v_1, v_2}=(V_1, V_2 \, ; E)$. Each data is obtained as a sum of selected effects, a subset of $E$. In…

Combinatorics · Mathematics 2023-09-01 Shoko Chisaki , Ryoh Fuji-Hara , Nobuko Miyamoto

This is the abstruct of the revised paper. We study the equivariant analytic torsion for K3 surfaces with an anti-symplectic involution with the invariant lattice M (such a surface is called a 2-elementary K3 surface of type M in this…

Algebraic Geometry · Mathematics 2007-05-23 Ken-Ichi Yoshikawa

There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, Seymour, van der Zypen and Wood states that every directed…

Combinatorics · Mathematics 2024-11-19 Michael Anastos , Oliver Cooley , Mihyun Kang , Matthew Kwan

Let $\Lambda$ be a local truncated path algebra over an algebraically closed field $K$, i.e., $\Lambda$ is a quotient of a path algebra $KQ$ by the paths of length $L+1$, where $Q$ is the quiver with a single vertex and a finite number of…

Representation Theory · Mathematics 2019-12-20 Birge Huisgen-Zimmermann

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…

Combinatorics · Mathematics 2015-08-24 Doron Puder

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

Combinatorics · Mathematics 2013-08-29 Nicolas Trotignon

For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…

Classical Analysis and ODEs · Mathematics 2024-11-01 Jianhui Li , Tongou Yang

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

Combinatorics · Mathematics 2011-10-05 Thomas Enkosky , Jeremy L. Martin

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

Representation Theory · Mathematics 2007-05-23 Vasyl Ostrovskyi

For a given digraph $D$ and distinct $u,v \in V(D)$, we denote by $\lambda_D(u,v)$ the local arc-connectivity from $u$ to $v$. Further, we define the total arc-connectivity $tac(D)$ of $D$ to be $\sum_{\{u,v\}\subseteq…

Combinatorics · Mathematics 2023-08-31 Florian Hörsch