Results 31 to 40 of about 4,003 (147)
Excluding Kuratowski graphs and their duals from binary matroids
, 2017 We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of {M(K3,3),M*(K3,3),M(K5),M*(K5)} that ...
Mayhew, Dillon +2 more
core +1 more source
Canonical Binary $$\Delta $$-Matroids
Graphs and CombinatoricsThe handle slide operation, originally defined for ribbon graphs, was extended to delta-matroids by I. Moffatt and E. Mphako-Bandab, who show that, using a delta-matroid analogue of handle slides, every binary delta-matroid in which the empty set is feasible can be written in a canonical form analogous to the canonical form for one-vertex maps on a ...
Avohou, Rémi Cocou +2 more
openaire +3 more sources
An introduction to coding sequences of graphs
, 2016 In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids which ...
Ghosh, Shamik +2 more
core +1 more source
, 2013 We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme (FPRAS) for the ...
Goldberg, Leslie Ann, Jerrum, Mark
core +1 more source
Nonlinear Matroid Optimization and Experimental Design [PDF]
, 2007 We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time algorithm for
Eva Riccomagno +7 more
core +7 more sources
Orienting Transversals and Transition Polynomials of Multimatroids
, 2017 Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the Tutte-Martin polynomial.
Brijder, Robert
core +1 more source
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
, 2017 The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all ...
Kazda, Alexandr +2 more
core +1 more source
European Journal of Combinatorics, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Some Algorithmic and Structural Results on Flames
Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
Maximum size binary matroids with no AG(3,2)-minor are graphic [PDF]
, 2013 We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound.
Kung, Joseph P. S. +3 more
core