Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

Abstract The main object of this paper is to determine the maximum number of { 0 , ± 1 } -vectors subject to the following… Expand

Is this relevant?

2014

2014

A $k$-uniform family of subsets of $[n]$ is intersecting if it does not contain a disjoint pair of sets. The study of… Expand

Is this relevant?

2014

2014

One of central issues in extremal set theory is Sperner’s theorem and its generalizations. Among such generalizations is the best… Expand

Is this relevant?

2012

2012

AbstractFor a given graph G and integers b,f ≥0, let S be a subset of vertices of G of size b+1 such that the subgraph of G… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced… Expand

Is this relevant?

2008

2008

For a given graph Gand integers b,f≥ 0, let Sbe a subset of vertices of Gofsize b+ 1 such that the subgraph of Ginduced bySis… Expand

Is this relevant?

1994

1985

1985

Theprofile of a hypergraph onn vertices is (f0, f1, ...,fn) wherefi denotes the number ofi-element edges. The extreme points of… Expand

Is this relevant?

1984

1984

Abstract Let X be a finite set of n -melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdos asked for the determination of… Expand

Is this relevant?