English
Related papers

Related papers: Free multiderivations of connected subgraph arrang…

200 papers

Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…

Combinatorics · Mathematics 2023-11-01 Lewis Stanton

The problem of finding dense induced bipartite subgraphs in $H$-free graphs has a long history, and was posed 30 years ago by Erd\H{o}s, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove…

Combinatorics · Mathematics 2019-07-09 Matthew Kwan , Shoham Letzter , Benny Sudakov , Tuan Tran

Given $k\ge 1$, a $k$-proper partition of a graph $G$ is a partition ${\mathcal P}$ of $V(G)$ such that each part $P$ of ${\mathcal P}$ induces a $k$-connected subgraph of $G$. We prove that if $G$ is a graph of order $n$ such that…

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…

Combinatorics · Mathematics 2019-07-18 Fengming Dong

The present paper explores a connection between two concepts arising from different fields of mathematics. The first concept, called vine, is a graphical model for dependent random variables. This concept first appeared in a work of Joe…

Combinatorics · Mathematics 2024-12-25 Hung Manh Tran , Tan Nhat Tran , Shuhei Tsujie

The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…

Operator Algebras · Mathematics 2022-09-09 Tomohiro Hayashi , Jeong Hee Hong , Sophie Emma Zegers , Wojciech Szymański

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

Combinatorics · Mathematics 2026-02-03 Peter J. Cameron

In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables…

Other Statistics · Statistics 2013-12-18 Kayvan Sadeghi

We introduce an embedding of the free magma on a set A into the direct product of the free magma on a singleton set and the free semigroup on A. This embedding is then used to prove several theorems related to algebraic independence of…

Rings and Algebras · Mathematics 2018-11-16 Cameron Ismail

We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\mathcal{A}$ and $\mathcal{A} \setminus \{H,L\}$ are free,…

Combinatorics · Mathematics 2023-06-21 Takuro Abe , Toru Yamaguchi

If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…

Algebraic Topology · Mathematics 2012-08-30 Vladimir Baranovsky , Radmila Sazdanovic

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…

Discrete Mathematics · Computer Science 2020-01-10 A. Akbari , S. Akbari , A. Doosthosseini , Z. Hadizadeh , Michael A. Henning , A. Naraghi

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. Brandst\"adt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandst\"adt, Le and Mosca…

Discrete Mathematics · Computer Science 2015-09-29 Andreas Brandstädt , Konrad K. Dabrowski , Shenwei Huang , Daniël Paulusma

If $k\geq 0$, then a $k$-edge-coloring of a graph $G$ is an assignment of colors to edges of $G$ from the set of $k$ colors, so that adjacent edges receive different colors. A $k$-edge-colorable subgraph of $G$ is maximum if it is the…

Discrete Mathematics · Computer Science 2018-07-18 Liana Karapetyan , Vahan Mkrtchyan

We prove that, on a large cone containing the constant multiplicities, the only free multiplicities on the braid arrangement are those identified in work of Abe, Nuida, and Numata (2009). We also give a conjecture on the structure of all…

Commutative Algebra · Mathematics 2017-05-09 Michael DiPasquale

As an instance of a linear action of a Hopf algebra on a free associative algebra, we consider finite group gradings of a free algebra induced by gradings on the space spanned by the free generators. The homogeneous component corresponding…

Rings and Algebras · Mathematics 2008-11-12 Vitor O. Ferreira , Lucia S. I. Murakami

We study the existence of free subalgebras in division algebras, and prove the following general result: if $A$ is a noetherian domain which is countably generated over an uncountable algebraically closed field $k$ of characteristic 0, then…

Rings and Algebras · Mathematics 2013-07-03 Jason P. Bell , D. Rogalski

In this paper, we observe the amalgamated free product structure of a Graph W*-probability space. In [16] and [17], we already observed the operator-valued freeness conditions on a graph W*-algebra. By using the conditions, we will consider…

Operator Algebras · Mathematics 2007-05-23 Ilwoo Cho

We introduce a family of dense subalgebras of the Toeplitz algebra and give conditions under which our algebras are quasi-free. As a corollary, we show that the smooth Toeplitz algebra introduced by Cuntz is quasi-free.

Operator Algebras · Mathematics 2021-09-09 A. Yu. Pirkovskii

Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…

Combinatorics · Mathematics 2024-12-23 Mahsa Zare , Saeid Alikhani , Mohammad Reza Oboudi
‹ Prev 1 4 5 6 7 8 10 Next ›