Results 101 to 110 of about 22,632 (241)
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
Journal of Graph Theory, Volume 109, Issue 4, Page 446-453, August 2025.ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
Радіоелектронні і комп'ютерні системиThe subject matter of the article is the efficiency analysis of greedy optimization algorithms for subset selection in distributed systems under delta-matroid constraints.
Inessa Kulakovska
doaj +1 more source
K-classes for matroids and equivariant localization [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 To every matroid, we associate a class in the K-theory of the Grassmannian. We study this class using the method of equivariant localization. In particular, we provide a geometric interpretation of the Tutte polynomial.
Alex Fink, David Speyer
doaj +1 more source
Matroid and Tutte-connectivity in infinite graphs [PDF]
, 2012 We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity ...
Bruhn, Henning
core
The Electronic Journal of Combinatorics, 2018 Regular matroids are binary matroids with no minors isomorphic to the Fano matroid $F_7$ or its dual $F_7^*$. Seymour proved that 3-connected regular matroids are either graphs, cographs, or $R_{10}$, or else can be decomposed along a non-minimal exact 3-separation induced by $R_{12}$.
openaire +2 more sources
Generic root counts and flatness in tropical geometry
Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.Abstract We use tropical and nonarchimedean geometry to study the generic number of solutions of families of polynomial equations over a parameter space Y$Y$. In particular, we are interested in the choices of parameters for which the generic root count is attained.
Paul Alexander Helminck, Yue Ren
wiley +1 more source
A Vector Matroid-Theoretic Approach in the Study of Structural Controllability Over F(z)
IEEE Access, 2017 In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. First, a vector matroid is defined over F(z). Second, the full rank conditions of [sI - A|B](s ∈ p) are derived in terms of
Yupeng Yuan +4 more
doaj +1 more source
A Note on the Sticky Matroid Conjecture
, 2009 A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is modular.
Bonin, Joseph E.
core
Efficient and strategy‐proof mechanism under general constraints
Theoretical Economics, Volume 20, Issue 2, Page 481-509, May 2025.This study investigates efficient and strategy‐proof mechanisms for allocating indivisible goods under constraints. First, we examine a setting without endowments. In this setting, we introduce a class of constraints—ordered accessibility—for which the serial dictatorship (SD) mechanism is Pareto‐efficient (PE), individually rational (IR), and group ...
Kenzo Imamura, Yasushi Kawase
wiley +1 more source
Power graphs and exchange property for resolving sets
Open Mathematics, 2019 Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source