Forbidden families of configurations

@article{Anstee2014ForbiddenFO,
  title={Forbidden families of configurations},
  author={Richard P. Anstee and Christina Koch},
  journal={Australasian J. Combinatorics},
  year={2014},
  volume={59},
  pages={361-377}
}
A simple matrix is a (0, 1)-matrix with no repeated columns. For a (0, 1)matrix F , we say that a (0, 1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let ‖A‖ denote the number of columns of A. Let F be a family of matrices. We define the extremal function forb(m,F) = max{‖A‖ : A is m-rowed simple matrix and has no configuration F ∈ F}. We consider some families F = {F1, F2… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
15 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

An extremal set problem

  • H.O.F. Gronau
  • Studia Sci.Math. Hungar. 15
  • 1980
Highly Influential
6 Excerpts

A fundamental matrix equation for finite sets

  • H. J. Ryser
  • Proc. Amer. Math. Soc. 34
  • 1972
Highly Influential
3 Excerpts

Forbidden Families of Configurations

  • C. L. Koch
  • M.Sc. Thesis, University of British Columbia
  • 2013
1 Excerpt

Similar Papers

Loading similar papers…