A nowhere-zero point in linear mappings
DOI10.1007/BF02125351zbMATH Open0717.05021DBLPjournals/combinatorica/AlonT89OpenAlexW1972913697WikidataQ64117605 ScholiaQ64117605MaRDI QIDQ753822FDOQ753822
Authors: Noga Alon, Michael Tarsi 
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125351
Recommendations
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Linear transformations, semilinear transformations (15A04)
Cites Work
Cited In (37)
- Weight choosability of graphs
- Minimal primes over permanental ideals
- Graphs are \((1, \varDelta + 1)\)-choosable
- The permanent rank of a matrix
- The polynomial method in the study of zero-sum theorems
- Coverings of Abelian groups and vector spaces.
- Every nice graph is (1,5)-choosable
- Matrix choosability
- Total weight choosability of graphs
- Total weight choosability for Halin graphs
- Total weight choosability of cone graphs
- On two generalizations of the Alon-Tarsi polynomial method
- Total weight choosability of Cartesian product of graphs
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
- Permanent index of matrices associated with graphs
- Every graph is \((2,3)\)-choosable
- Permanent Polya problem for additive surjective maps
- Total Weight Choosability of Trees
- Nowhere-zero eigenvectors of graphs
- Dense Eulerian graphs are \((1, 3)\)-choosable
- Generalizations and applications of the nowhere zero linear mappings in network coding
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- On various restricted sumsets
- Title not available (Why is that?)
- On linear preservers of permanental rank
- Additive bases of vector spaces over prime fields
- Colorings and orientations of graphs
- On the number of nowhere zero points in linear mappings
- Improved bounds for the sunflower lemma
- The hat guessing number of graphs
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Title not available (Why is that?)
- On the existence of nowhere-zero vectors for linear transformations
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Unification of zero-sum problems, subset sums and covers of ℤ
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
- Linear extension of the Erdős-Heilbronn conjecture
This page was built for publication: A nowhere-zero point in linear mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753822)
