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

The proof of a conjecture of G. O. H. Katona

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

DOI10.1016/S0097-3165(75)80009-4zbMath0308.05003WikidataQ123239259 ScholiaQ123239259MaRDI QIDQ1218425

Peter Frankl

Publication date: 1975

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



Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)


Related Items

The number of meets between two subsets of a lattice, Perfect matchings in down-sets, An intersection problem for codes, The maximum size of intersecting and union families of sets, Erdös–Ko–Rado Theorem—22 Years Later, On systems of finite sets with constraints on their unions and intersections, Invitation to intersection problems for finite sets, Combinatorial analysis. (Matrix problems, choice theory), On families of finite sets with bounds on unions and intersections, The \(t\)-intersection problem in the truncated Boolean lattice



Cites Work

  • Unnamed Item
  • INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
  • Intersection theorems for systems of finite sets
  • Families of Non-disjoint subsets
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1218425&oldid=13286899"
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 07:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki