Pages that link to "Item:Q909697"
From MaRDI portal
The following pages link to Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius (Q909697):
Displaying 11 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Some additive applications of the isoperimetric approach (Q954814) (← links)
- Addendum to ``Structure theorem for multiple addition'' (Q1360712) (← links)
- On consecutive subset sums (Q1584298) (← links)
- Weighted multi-connected loop networks (Q1910548) (← links)
- More on change-making and related problems (Q2051861) (← links)
- The Frobenius postage stamp problem, and beyond (Q2220981) (← links)
- A multiple set version of the \(3k-3\) theorem (Q2567444) (← links)
- On regular Frobenius bases. (Q4733936) (← links)
- The structure of higher sumsets (Q5039241) (← links)
- (Q5874497) (← links)
