A nowhere-zero point in linear mappings
From MaRDI portal
Publication:753822
DOI10.1007/BF02125351zbMath0717.05021OpenAlexW1972913697WikidataQ64117605 ScholiaQ64117605MaRDI QIDQ753822
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125351
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Linear transformations, semilinear transformations (15A04)
Related Items (35)
Graphs are \((1, \varDelta + 1)\)-choosable ⋮ On the number of nowhere zero points in linear mappings ⋮ Total weight choosability of cone graphs ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Coverings of Abelian groups and vector spaces. ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable ⋮ Permanent Polya problem for additive surjective maps ⋮ The polynomial method in the study of zero-sum theorems ⋮ Total Weight Choosability of Trees ⋮ Generalizations and applications of the nowhere zero linear mappings in network coding ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On linear preservers of permanental rank ⋮ Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ Minimal primes over permanental ideals ⋮ Total weight choosability of Cartesian product of graphs ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Linear extension of the Erdős-Heilbronn conjecture ⋮ Total weight choosability of graphs ⋮ Additive bases of vector spaces over prime fields ⋮ 2-connected chordal graphs and line graphs are \((1,5)\)-choosable ⋮ Matrix choosability ⋮ Nowhere-zero eigenvectors of graphs ⋮ Permanent index of matrices associated with graphs ⋮ Colorings and orientations of graphs ⋮ Every graph is \((2,3)\)-choosable ⋮ Unification of zero-sum problems, subset sums and covers of ℤ ⋮ Weight choosability of graphs ⋮ ON THE EXISTENCE OF NOWHERE-ZERO VECTORS FOR LINEAR TRANSFORMATIONS ⋮ Total weight choosability of graphs: towards the 1-2-3-conjecture ⋮ Total weight choosability for Halin graphs ⋮ Improved bounds for the sunflower lemma ⋮ The permanent rank of a matrix ⋮ The hat guessing number of graphs ⋮ On various restricted sumsets
Cites Work
This page was built for publication: A nowhere-zero point in linear mappings
