Solution of a problem of A. Ehrenfeucht and J. Mycielski
From MaRDI portal
Publication:1846871
DOI10.1016/0097-3165(74)90018-1zbMath0289.05002OpenAlexW2025247912WikidataQ100329051 ScholiaQ100329051MaRDI QIDQ1846871
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/21111/1/paper_25.pdf
Related Items
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Covering graphs by the minimum number of equivalence relations, Almost intersecting families, Intersecting families with sunflower shadows, Counting Intersecting and Pairs of Cross-Intersecting Families, Inclusion matrices for rainbow subsets, An extremal problem for two families of sets, An extremal problem for sets: A new approach via Bezoutians, In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton, Graph-intersecting set systems and LYM inequalities, Mengerian theorems for paths of bounded length, A generalization of the Bollobás set pairs inequality, Matchings and covers in hypergraphs, Bollobás-type theorems for hemi-bundled two families, On disjointly representable sets, Geometrical solution of an intersection problem for two hypergraphs, An extremal problem for sets with applications to graph theory, Critical hypergraphs and interesting set-pair systems
Cites Work
