Triangle-Free Subgraphs of Hypergraphs
- 28 July 2021
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2555-2570
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation Graduate Research Fellowship (DGE-1650112)
- National Science Foundation (DMS-1952786)
This publication has 21 references indexed in Scilit:
- The number of hypergraphs without linear cyclesJournal of Combinatorial Theory, Series B, 2019
- Combinatorial theorems in sparse random setsAnnals of Mathematics, 2016
- Mantel's theorem for random graphsRandom Structures & Algorithms, 2014
- On the triangle space of a random graphJournal of Combinatorics, 2013
- The number of K
s,t
-free graphsJournal of the London Mathematical Society, 2011
- An Extremal Theorem in the HypercubeThe Electronic Journal of Combinatorics, 2010
- Erdős–Ko–Rado in Random HypergraphsCombinatorics, Probability and Computing, 2009
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentGraphs and Combinatorics, 1986
- On the combinatorial problems which I would most like to see solvedCombinatorica, 1981
- On Sequences of Numbers not Divisible one by anotherJournal of the London Mathematical Society, 1935