The following pages link to (Q4175585):
Displaying 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Saturating Sperner families (Q367051) (← links)
- Color the cycles (Q383778) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- On possible Turán densities (Q466081) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- A counterexample to sparse removal (Q472399) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← links)
- The joints problem for matroids (Q482235) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- The critical window for the classical Ramsey-Turán problem (Q520045) (← links)
- Extremal Betti numbers of Vietoris-Rips complexes (Q542387) (← links)
- On the density of a graph and its blowup (Q602726) (← links)
- Large joints in graphs (Q607362) (← links)
- The fine structure of octahedron-free graphs (Q631642) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- The homomorphism domination exponent (Q648968) (← links)
- More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- The asymptotic induced matching number of hypergraphs: balanced binary strings (Q783062) (← links)
- On the existence of dense substructures in finite groups (Q785824) (← links)
- A variant of the hypergraph removal lemma (Q855826) (← links)
- Unavoidable tournaments (Q895998) (← links)
- Diameter critical graphs (Q905895) (← links)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374) (← links)
- Unavoidable patterns (Q958758) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- Small stopping sets in Steiner triple systems (Q1032486) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- On subsets of abelian groups with no 3-term arithmetic progression (Q1088718) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Saturated \(r\)-uniform hypergraphs (Q1184855) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- The Erdős-Ko-Rado theorem for small families (Q1320390) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- On ordered Ramsey numbers of bounded-degree graphs (Q1633749) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- The sum of nonsingular matrices is often nonsingular (Q1754432) (← links)
- A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Maximal antichains of minimum size (Q1953477) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316) (← links)
