English
Related papers

Related papers: A note on the Weiss conjecture

200 papers

In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…

Probability · Mathematics 2025-09-30 Neeladri Maitra

The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\overline{G}) = |E(\overline{G})| \leq \lfloor n/2 \rfloor…

Combinatorics · Mathematics 2024-11-21 Wayne Barrett , Shaun Fallat , Veronika Furst , Shahla Nasserasr , Brendan Rooney , Michael Tait

Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formulate Vizing's conjecture as a Positivstellensatz existence…

Combinatorics · Mathematics 2021-08-13 Elisabeth Gaar , Daniel Krenn , Susan Margulies , Angelika Wiegele

Bollob\'{a}s and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\in V(G)$, $d_H(v)\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for…

Combinatorics · Mathematics 2017-01-26 Yuliang Ji , Jie Ma , Juan Yan , Xingxing Yu

If a quantum walk starting on a vertex tends to stay at home, then that vertex is said to be sedentary. We prove that almost all planar graphs and almost all trees contain at least two sedentary vertices for any assignment of edge weights…

Combinatorics · Mathematics 2026-01-28 Karen Meagher , Hermie Monterde

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

Group Theory · Mathematics 2019-06-07 Vincent Guirardel , Gilbert Levitt

In this article, we study eigenvalue functions of varying transition probability matrices on finite, vertex transitive graphs. We prove that the eigenvalue function of an eigenvalue of fixed higher multiplicity has a critical point if and…

Group Theory · Mathematics 2014-10-20 Ioannis Ivrissimtzis , Norbert Peyerimhoff

Let $G$ be a locally compact group. For every $G$-flow $X$, one can consider the stabilizer map $x \mapsto G_x$, from $X$ to the space $\mathrm{Sub}(G)$ of closed subgroups of $G$. This map is not continuous in general. We prove that if one…

Group Theory · Mathematics 2023-11-07 Adrien Le Boudec , Todor Tsankov

We consider a natural graph operation $\Omega_k$ that is a certain inverse (formally: the right adjoint) to taking the k-th power of a graph. We show that it preserves the topology (the $\mathbb{Z}_2$-homotopy type) of the box complex, a…

Combinatorics · Mathematics 2019-05-15 Marcin Wrochna

The Weiss variational principle in mechanics and classical field theory is a variational principle which allows displacements of the boundary. We review the Weiss variation in mechanics and classical field theory, and present a novel…

General Relativity and Quantum Cosmology · Physics 2018-07-25 Justin C. Feng , Richard A. Matzner

We consider a model of stable edge sets (``matchings'') in a bipartite graph $G=(V,E)$ in which the preferences for vertices of one side (``firms'') are given via choice functions subject to standard axioms of consistency, substitutability…

Combinatorics · Mathematics 2025-01-28 Alexander V. Karzanov

A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ in $G$ with $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes in balanced bipartite graphs subject to conditions involving…

Combinatorics · Mathematics 2020-04-13 Stefan Ehard , Elena Mohr , Dieter Rautenbach

A conjecture due to Zassenhaus asserts that if $\ G$ is a finite group then any torsion unit in $\mathbb{Z}G$ is conjugate in $\mathbb{Q}G$ to an element of $\ G$. We present a weaker form of this conjecture for some infinite groups.

Group Theory · Mathematics 2012-10-09 S. O. Juriaans , A. De A. E Silva , A. C. Souza Filho

The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…

Combinatorics · Mathematics 2013-10-07 Matthias Beck , Michael Jackanich

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

We discuss the stability of vacua in two-dimensional gauge theory for any simple, simply connected gauge group. Making use of the representation of a vacuum in terms of a Wilson line at infinity, we determine which vacua are stable against…

High Energy Physics - Theory · Physics 2009-10-31 Victor Kac , Jan Troost

In the present study we consider an example of a boundary value problem for a simple second order ordinary differential equation, which may exhibit a boundary layer phenomenon. We show that usual central finite differences, which are second…

Numerical Analysis · Mathematics 2020-02-20 Gayaz Khakimzyanov , Denys Dutykh

We show that Wise's power alternative is stable under certain group constructions, use this to prove the power alternative for new classes of groups, and recover known results from a unified perspective. For groups acting on trees, we…

Group Theory · Mathematics 2025-12-03 Mark Hagen , Alexandre Martin , Giovanni Sartori

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

Combinatorics · Mathematics 2016-07-08 Sven Schäge

Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive…

Discrete Mathematics · Computer Science 2017-11-21 Gregory Gutin , Ruijuan Li
‹ Prev 1 8 9 10 Next ›