Pages that link to "Item:Q753822"
From MaRDI portal
The following pages link to A nowhere-zero point in linear mappings (Q753822):
Displaying 37 items.
- Total weight choosability of cone graphs (Q293660) (← links)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Generalizations and applications of the nowhere zero linear mappings in network coding (Q616419) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Linear extension of the Erdős-Heilbronn conjecture (Q654893) (← links)
- The hat guessing number of graphs (Q777481) (← links)
- Coverings of Abelian groups and vector spaces. (Q857412) (← links)
- Additive bases of vector spaces over prime fields (Q1175950) (← links)
- Colorings and orientations of graphs (Q1196681) (← links)
- The permanent rank of a matrix (Q1284166) (← links)
- On the number of nowhere zero points in linear mappings (Q1330794) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Matrix choosability (Q1976325) (← links)
- Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Permanent Polya problem for additive surjective maps (Q2176131) (← links)
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
- On various restricted sumsets (Q2569013) (← links)
- The polynomial method in the study of zero-sum theorems (Q2942520) (← links)
- ON THE EXISTENCE OF NOWHERE-ZERO VECTORS FOR LINEAR TRANSFORMATIONS (Q3065425) (← links)
- Minimal primes over permanental ideals (Q3508037) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- (Q4508763) (← links)
- Unification of zero-sum problems, subset sums and covers of ℤ (Q4680991) (← links)
- Nowhere-zero eigenvectors of graphs (Q4908176) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- Total weight choosability of graphs (Q5894172) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- On linear preservers of permanental rank (Q6087880) (← links)
- (Q6091021) (← links)
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
