中文
相关论文

相关论文: Towards a splitter theorem for internally 4-connec…

200 篇论文

A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…

组合数学 · 数学 2014-04-24 O-joung Kwon , Sang-il Oum

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

组合数学 · 数学 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained…

组合数学 · 数学 2022-06-24 Nick Brettell , Charles Semple , Gerry Toft

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

组合数学 · 数学 2011-07-08 Harald Fripertinger , Marcel Wild

We establish an explicit criterion for determining whether a $4 \times 4$ upper-triangular matrix is a contraction with respect to the Euclidean operator norm.

泛函分析 · 数学 2025-06-17 Axel Renard

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

组合数学 · 数学 2012-12-18 Nathan Bowler , Johannes Carmesin

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

组合数学 · 数学 2024-05-27 Joshua Erde , Pascal Gollin , Attila Joó , Paul Knappe , Max Pitz

The splitting operation on a $p$-matroid does not necessarily preserve connectivity. It is observed that there exists a single element extension of the splitting matroid which is connected. In this paper, we define the element splitting…

组合数学 · 数学 2025-07-15 P. P. Malavadkar , Sachin Gunjal , Uday Jagadale

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

组合数学 · 数学 2012-04-30 Hadi Afzali , Nathan Bowler

A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…

组合数学 · 数学 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

Given a $\{ 0, 1, \ast \}$-matrix $M$, a minimal $M$-obstruction is a digraph $D$ such that $D$ is not $M$-partitionable, but every proper induced subdigraph of $D$ is. In this note we present a list of all the $M$-obstructions for every $2…

组合数学 · 数学 2016-06-01 Pavol Hell , César Hernández-Cruz

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

组合数学 · 数学 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…

组合数学 · 数学 2023-01-06 Shital D. Solanki , Ganesh Mundhe , S. B. Dhotre

Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $\Gamma$-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and…

组合数学 · 数学 2018-12-05 Y. M. Borse , Ganesh Mundhe

We show that, if $M$ is a simple rank-$n$ matroid with no $\ell$-point line minor and no minor isomorphic to the cycle matroid of a $t$-vertex complete graph, then the ratio $|M| / n$ is bounded above by a singly exponential function of…

组合数学 · 数学 2023-06-28 Peter Nelson , Sergey Norin , Fernanda Rivera Omana

We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…

组合数学 · 数学 2025-07-09 Matt DeVos , Mahdieh Malekian

While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…

综合数学 · 数学 2014-11-12 O. Veko , E. Ovsiyuk , A. Oana , M. Neagu , V. Balan , V. Red'kov

Polar decompositions of quaternion matrices with respect to a given indefinite inner product are studied. Necessary and sufficient conditions for the existence of an $H$-polar decomposition are found. In the process an equivalent to Witt's…

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

组合数学 · 数学 2015-11-12 Shalev Ben-David , Jim Geelen

We describe the one-dimensional \v{C}eby\v{s}\"{e}v subspaces of a JBW$^*$-triple $M,$ by showing that for a non-zero element $x$ in $M$, $\mathbb{C}x$ is a \v{C}eby\v{s}\"{e}v subspace of $M$ if, and only if, $x$ is a Brown-Pedersen…

‹ 上一页 1 8 9 10 下一页 ›