Alpha-balanced graphs and matrices and GF(3)-representability of matroids

DOI10.1016/0095-8956(82)90028-4zbMath0478.05026OpenAlexW2042708383MaRDI QIDQ1160629

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90028-4

zbMATH Keywords

representability unimodularity matroid

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Oriented hypergraphs: balanceability, A decomposition theory for matroids. II. Minimal violation matroids, Matroids are not Ehrhart positive, Negative (and positive) circles in signed graphs: a problem collection, On perfect \(0,\pm 1\) matrices, Decomposition of wheel-and-parachute-free balanced bipartite graphs, A decomposition theory for matroids. V: Testing of matrix total unimodularity, Relaxations of \(\mathrm{GF}(4)\)-representable matroids, A generalization of Tutte's characterization of totally unimodular matrices, Triangulated neighborhoods in even-hole-free graphs, Universally signable graphs, Signed analogs of bipartite graphs, The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs, A short proof of Tutte's characterization of totally unimodular matrices, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Clique cutsets beyond chordal graphs, Negative circles in signed graphs: a problem collection, On the Ehrhart polynomial of minimal matroids, Matroid relaxations and Kazhdan-Lusztig non-degeneracy, Oriented hypergraphs: introduction and balance, Structure and algorithms for (cap, even hole)-free graphs, A mickey-mouse decomposition theorem, (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels, Completing and extending shellings of vertex decomposable complexes, Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs, Theta-ring graphs, \(\mathrm{I}{{\mathcal{O}}} \)-compatibility and \(\Delta \)-matroids, Matroids with many common bases., Balanced matrices, On the forbidden induced subgraph sandwich problem, A note on chromatic number of (cap, even hole)-free graphs, Square-free perfect graphs., Unnamed Item, The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs, Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey, Perfect \(0,\pm 1\) matrices, Concave extensions for nonlinear 0-1 maximization problems, A Class of Three‐Colorable Triangle‐Free Graphs, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Matroids with few non-common bases, Partial matroid representations, Even-hole-free graphs part I: Decomposition theorem, A structure theorem for graphs with no cycle with a unique chord and its consequences, Vertex elimination orderings for hereditary graph classes, The sandwich problem for decompositions and almost monotone properties, A characterization of oriented hypergraphic balance via signed weak walks, Characterizations of ternary matroids in terms of circuit signatures, Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences, On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis, Decomposition of balanced matrices, Decomposition of odd-hole-free graphs by double star cutsets and 2-joins, On the efficiency of representability tests for matroids, A polynomial recognition algorithm for balanced matrices, Balanced cycles and holes in bipartite graphs, On matroids with many common bases, A geometric approach to forbidden minors for GF(3), The excluded minors for GF(4)-representable matroids, Balanced \(0,\pm 1\) matrices. I: Decomposition, A short note on some tractable cases of the satisfiability problem., A decomposition theory for matroids. I: General results, Recognizing balanceable matrices, Completing and Extending Shellings of Vertex Decomposable Complexes, Linear Balanceable and Subcubic Balanceable Graphs*, Signatures and signed switching classes

Cites Work