Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A simple proof of a theorem of Milner

From MaRDI portal
Publication:1268609
Jump to:navigation, search

DOI10.1006/jcta.1997.2848zbMath0905.05081OpenAlexW2092058985MaRDI QIDQ1268609

No author found.

Publication date: 14 January 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/21082/1/paper_86.pdf


zbMATH Keywords

cyclic permutation methodintersecting Sperner family


Mathematics Subject Classification ID

Extremal set theory (05D05)


Related Items (2)

Intersecting \(P\)-free families ⋮ Another simple proof of a theorem of Milner



Cites Work

  • A simple proof of the Erdős-Chao Ko-Rado theorem
  • Intersection theorems for systems of finite sets
  • A Combinatorial Theorem on Systems of Sets




This page was built for publication: A simple proof of a theorem of Milner

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1268609&oldid=13368479"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki