Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Bounding the Number of Hyperedges in Friendship $r$-Hypergraphs
Karen Gunderson
,
Natasha Morrison
,
Jason Semeraro
Type:
Preprint
Publication Date:
2014-12-18
Citations:
0
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Bounding the Number of Hyperedges in Friendship $r$-Hypergraphs
2014
Karen Gunderson
Natasha Morrison
Jason Semeraro
+
Bounding the number of hyperedges in friendship <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si101.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-hypergraphs
2015
Karen Gunderson
Natasha Morrison
Jason Semeraro
+
A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.
2013
Pak Ching Li
Glynda Rees
+
Regular subgraphs of uniform hypergraphs
2016
Jaehoon Kim
+
On the sizes of $k$-edge-maximal $r$-uniform hypergraphs
2018
Yingzhi Tian
Liqiong Xu
Hong‐Jian Lai
Jixiang Meng
+
Finding and counting cliques and independent sets in r-uniform hypergraphs
2006
Raphael Yuster
+
PDF
Chat
A note on improved bounds for hypergraph rainbow matching problems
2025
Candida Bowtell
Andrea Freschi
Gal Kronenberg
Jun Yan
+
Kalai's conjecture in $r$-partite $r$-graphs
2019
Maya Stein
+
On the sizes of vertex-$k$-maximal $r$-uniform hypergraphs
2018
Yingzhi Tian
Hong‐Jian Lai
Jixiang Meng
+
Subgraphs with Large Minimum $\ell$-Degree in Hypergraphs where Almost All $\ell$-Degrees are Large
2018
Victor Falgas–Ravry
Allan Lo
+
Subgraphs with large minimum $\ell$-degree in hypergraphs where almost all $\ell$-degrees are large
2016
Victor Falgas‐Ravry
Allan Lo
+
Subgraphs with large minimum $\ell$-degree in hypergraphs where almost all $\ell$-degrees are large
2016
Victor Falgas‐Ravry
Allan Lo
+
A generalization of Erdős' matching conjecture
2017
Christos Pelekis
Israel Rocha
+
A generalization of Erdős' matching conjecture
2017
Christos Pelekis
Israel Rocha
+
Counting Hypergraphs with Large Girth
2020
Sam Spiro
Jacques Verstraëte
+
A generalization of Erd\H{o}s' matching conjecture
2017
Christos Pelekis
Israel Rocha
+
On the number of linear hypergraphs of large girth
2017
József Balogh
Lina Li
+
Turán numbers of $r$-graphs on $r+1$ vertices
2022
Alexander Sidorenko
+
Chromatic Ramsey number of acyclic hypergraphs
2015
András Gyárfás
Alexander W. N. Riasanovsky
Melissa Sherman-Bennett
+
On the sizes of $(k,l)$-edge-maximal $r$-uniform hypergraphs
2018
Yingzhi Tian
Hong‐Jian Lai
Jixiang Meng
Murong Xu
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (9)
Action
Title
Year
Authors
+
The existence of designs
2014
Peter Keevash
+
Regularity Lemma for k‐uniform hypergraphs
2004
Vojtěch Rödl
Jozef Skokan
+
The friendship theorem
1972
Judith Q. Longyear
T. D. Parsons
+
The Friendship Theorem
2002
Craig Huneke
+
On a question of Sós about 3‐uniform friendship hypergraphs
2008
Stephen G. Hartke
Jennifer Vandenbussche
+
The counting lemma for regular k-uniform hypergraphs
2006
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
2006
W. T. Gowers
+
A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.
2013
Pak Ching Li
Glynda Rees
+
Hypergraph regularity and the multidimensional Szemerédi theorem
2007
W. T. Gowers