How different can two intersecting families be?
Patkós, Balázs (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Isomorphism classes of maximal intersecting uniform families are few.”
How different can two intersecting families be?
Traces of uniform families of sets.
Patkós, Balázs (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sunflowers in lattices.
McKenna, Geoffrey (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The intersection structure of -intersecting families.
Talbot, John (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Hilton-Milner theorem for vector spaces.
Blokhuis, A., Brouwer, A.E., Chowdhury, A., Frankl, P., Mussche, T., Patkós, B., Szönyi, T. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Set-systems with restricted multiple intersections.
Grolmusz, Vince (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniform atoms on
Simon, P.
Similarity:
Uniform boundedness of a family of exhaustive set functions
E. Pap (1976)
Matematički Vesnik
Similarity:
A paintability version of the combinatorial Nullstellensatz, and list colorings of -partite -uniform hypergraphs.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three
Joanna Polcyn (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-color Ramsey number for P is R(P; r) = r + 6 for r ≤ 9. The proof of this result relies on a careful analysis of the Turán numbers for P. In this paper, we refine this analysis further and compute the fifth order Turán number for P, for all n. Using this number for n = 16, we confirm the formula R(P; 10) = 16.
A new construction for cancellative families of sets.
Shearer, James B. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniform edge distribution in hypergraphs is hereditary.
Mubayi, Dhruv, Rödl, Vojtěch (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Traces without maximal chains.
Tan, Ta Sheng (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: