scientific article; zbMATH DE number 3849971
From MaRDI portal
Publication:3319331
zbMATH Open0535.51009MaRDI QIDQ3319331FDOQ3319331
László Lovász, Alexander Schrijver
Publication date: 1981
Title of this publication is not available (Why is that?)
Recommendations
- On a generalization of Rédei's theorem
- Some generalizations of Rédei’s theorem
- Around Rédei's theorem
- A new proof of Rédei's theorem
- scientific article
- A short proof of Rédei's theorem
- Redheffer's theorem revisited
- A Note On Reed's Conjecture
- A remark on a theorem by Deligne
- Remarks on a theorem of Perron
Polynomials over finite fields (11T06) Finite affine and projective planes (geometric aspects) (51E15)
Cited In (27)
- On the number of directions determined by a pair of functions over a prime field
- Functions over finite fields that determine few directions
- Semiarcs with long secants
- Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
- Special directions on the finite affine plane
- Point distribution and perfect directions in \(\mathbb{F}_p^2\)
- Blocking sets in Desarguesian affine and projective planes
- The number of directions determined by a function over a finite field.
- On the graph of a function over a prime field whose small powers have bounded degree
- The number of directions determined by a function \(f\) on a finite field
- Bilinear flocks
- On a theorem of Redheffer concerning diagonal stability
- Some generalizations of Rédei’s theorem
- Maximal integral point sets in affine planes over finite fields
- Title not available (Why is that?)
- Maximum distance separable codes and arcs in projective spaces
- Nearfield planes and the direction problem in \(\mathrm{AG}(2,q^2)\)
- On a generalization of Rédei's theorem
- On rich and poor directions determined by a subset of a finite plane
- Remark on Wielandt's visibility theorem
- Factoring elementary groups of prime cube order into subsets
- Extremal Peisert-type graphs without the strict-EKR property
- Embedding maximal cliques of sets in maximal cliques of bigger sets
- Blocking sets of almost Rédei type
- On the size of the smallest non-classical blocking set of Rédei type in \(PG (2, p)\)
- A remark on blocking sets of almost Rédei type
- Redheffer's theorem revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3319331)
