Bounds for a Linear Diophantine Problem of Frobenius
From MaRDI portal
Cited in
(22)- On a conjecture about the exponent set of primitive matrices
- On the exponents of primitive digraphs with the shortest elementary circuit length s
- Local exponents of primitive digraphs
- A bound for Wilson's general theorem
- The existence of resolvable BIBD with \(\lambda=1\)
- The upper bound of Frobenius related length functions
- Proof of a conjecture about the exponent of primitive matrices
- On a linear diophantine problem for geometrical type sequences
- A bound connected with primitive matrices
- Refined upper bounds for the linear Diophantine problem of Frobenius
- On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\)
- A diophantine problem of Frobenius in terms of the least common multiple
- A diameter bound on the exponent of a primitive directed graph
- Some estimated formulas for the Frobenius numbers
- A bound on the exponent of primitivity in terms of diameter
- Scrambling index set of primitive digraphs
- On a linear Diophantine problem of Frobenius.
- Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
- Some Experimental Results on the Frobenius Problem
- scientific article; zbMATH DE number 5041220 (Why is no real title available?)
- On the exponent of a primitive digraph
- An optimal lower bound for the Frobenius problem
This page was built for publication: Bounds for a Linear Diophantine Problem of Frobenius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4056082)