scientific article; zbMATH DE number 3221072
From MaRDI portal
Publication:5510578
zbMath0136.21302MaRDI QIDQ5510578
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Minimum degree conditions for tight Hamilton cycles, Ramsey-Turán type results for matchings in edge colored graphs, Families with restricted matching number and multiply covered shadows, A proof of Frankl's conjecture on cross-union families, A proof of Frankl–Kupavskii's conjecture on edge‐union condition, Turán numbers for hypergraph star forests, A note on exact minimum degree threshold for fractional perfect matchings, Stability on matchings in 3-uniform hypergraphs, Erdős-Ko-Rado type theorems for simplicial complexes, Rainbow version of the Erdős Matching Conjecture via concentration, Turán numbers for 3-uniform linear paths of length 3, A Stability Result on Matchings in 3-Uniform Hypergraphs, Multicoloured extremal problems, Families with no perfect matchings, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, Size and structure of large \((s,t)\)-union intersecting families, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, A note on fractional covers of a graph, Turán numbers of sunflowers, Fractional and integer matchings in uniform hypergraphs, Exact solution of some Turán-type problems, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, Sharp bounds for the chromatic number of random Kneser graphs, The Erdős matching conjecture and concentration inequalities, Remarks on the Erdős matching conjecture for vector spaces, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Improved bounds for Erdős' matching conjecture, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, Anti-Ramsey number of matchings in hypergraphs, On the maximum number of edges in hypergraphs with fixed matching and clique number, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, Proof of the Erdős matching conjecture in a new range, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, On maximal tail probability of sums of nonnegative, independent and identically distributed random variables, Turán numbers for disjoint paths, Structure and supersaturation for intersecting families, A degree version of the Hilton-Milner theorem, Extremal Problem for Matchings and Rainbow Matchings on Direct Products, On families with bounded matching number, Improved bound on vertex degree version of Erdős matching conjecture, Families with no matchings of size \(s\), A better bound on the size of rainbow matchings, Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs, Nonnegative \(k\)-sums, fractional covers, and probability of small deviations, Erdős matching conjecture for almost perfect matchings, How to Poison Your Mother-in-Law, and Other Caching Problems, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, On Rainbow Matchings for Hypergraphs, Stability for vertex isoperimetry in the cube, Completion and deficiency problems, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Hypergraph Turán numbers of linear cycles, The structure of large intersecting families, The maximum number of cliques in hypergraphs without large matchings, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, High dimensional Hoffman bound and applications in extremal combinatorics, On Erdős' extremal problem on matchings in hypergraphs, Local Turan property for k-graphs, Arrangements of \(k\)-sets with intersection constraints, The size of 3-uniform hypergraphs with given matching number and codegree, On the random version of the Erdős matching conjecture, Edge-colorings of uniform hypergraphs avoiding monochromatic matchings, On the size of shadow-added intersecting families, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Random Kneser graphs and hypergraphs, Rainbow matchings in properly-colored hypergraphs, The Turán number of \(k \cdot S_\ell \), The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Unavoidable hypergraphs, On the maximum number of edges in a hypergraph with given matching number, A generalization of Erdős' matching conjecture, On non-trivial families without a perfect matching, Erdös–Ko–Rado Theorem—22 Years Later, Unnamed Item, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, On the maximum size of subfamilies of labeled set with given matching number, Mixed matchings in graphs, Extremal \(G\)-free induced subgraphs of Kneser graphs, Linear trees in uniform hypergraphs, Beyond the Erdős matching conjecture, Old and new applications of Katona's circle, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Simple juntas for shifted families, Rainbow matchings for 3-uniform hypergraphs, Multiply union families in \(\mathbb{N}^n\), Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, Tight bounds for Katona's shadow intersection theorem, Rainbow factors in hypergraphs, Families of finite sets satisfying intersection restrictions, Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman, Nearly Perfect Matchings in Uniform Hypergraphs, Degree versions of theorems on intersecting families via stability, Vertex degree sums for matchings in 3-uniform hypergraphs, Rainbow matchings in k‐partite hypergraphs, On the size of the product of overlapping families, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, Maximum size of a graph with given fractional matching number, On the rainbow matching conjecture for 3-uniform hypergraphs, Extremal problems concerning Kneser-graphs, Families of finite sets in which no set is covered by the union of \(r\) others, On the bandwidth of the Kneser graph
