The following pages link to On hypergraphs of girth five (Q1408529):
Displaying 39 items.
- Proof of a conjecture on monomial graphs (Q346278) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Hypergraphs with no cycle of length 4 (Q411654) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- \(k\)-fold Sidon sets (Q463053) (← links)
- A counterexample to sparse removal (Q472399) (← links)
- Connectivity of some algebraically defined digraphs (Q888582) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Small stopping sets in Steiner triple systems (Q1032486) (← links)
- Triangle-free induced subgraphs of the unitary polarity graph (Q1645061) (← links)
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) (Q1684649) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723) (← links)
- Saturation of Berge hypergraphs (Q1999741) (← links)
- On grids in point-line arrangements in the plane (Q2022623) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Spectral extremal results for hypergraphs (Q2049621) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- Generalized Turán problems for complete bipartite graphs (Q2084784) (← links)
- Multicolor Ramsey numbers for Berge cycles (Q2112557) (← links)
- A linear hypergraph extension of Turán's theorem (Q2112579) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- The linear Turán number of small triple systems or why is the wicket interesting? (Q2166284) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- A linear hypergraph extension of the bipartite Turán problem (Q2225452) (← links)
- Quantum structures without group-valued measures (Q2239396) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- On modular \(k\)-free sets (Q2344820) (← links)
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph (Q2344823) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
- Independent Sets in Polarity Graphs (Q2832577) (← links)
- Hypergraphs with no odd cycle of given length (Q2851489) (← links)
- On Grids in Point-Line Arrangements in the Plane (Q5088982) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- Triangles in C5‐free graphs and hypergraphs of girth six (Q6056790) (← links)
- Counting hypergraphs with large girth (Q6081555) (← links)
- Book free 3-uniform hypergraphs (Q6177430) (← links)
