The following pages link to (Q3337470):
Displaying 50 items.
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- A conjecture of Erdős on graph Ramsey numbers (Q531812) (← links)
- On the maximum number of five-cycles in a triangle-free graph (Q713972) (← links)
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (Q859617) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Vertex Turán problems in the hypercube (Q965224) (← links)
- The game of \(\mathcal F\)-saturator (Q968127) (← links)
- Bounding the size of square-free subgraphs of the hypercube (Q1024494) (← links)
- Some Turán type results on the hypercube (Q1043648) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- Minimal covers of \(S_ n\) by Abelian subgroups and maximal subsets of pairwise noncommuting elements (Q1117036) (← links)
- Pentagons in triangle-free graphs (Q1671749) (← links)
- A note on the maximum number of triangles in a \(C_5\)-free graph (Q1689946) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs (Q2032881) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- The vertex Turán density in 3-ary \(n\)-cubes (Q2078847) (← links)
- Generalized Turán densities in the hypercube (Q2099479) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- The \(Q_2\)-free process in the hypercube (Q2213808) (← links)
- On even-cycle-free subgraphs of the doubled Johnson graphs (Q2242794) (← links)
- Extremal even-cycle-free subgraphs of the complete transposition graphs (Q2243230) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- A note on lower bounds for induced Ramsey numbers (Q2416949) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Vertex Turán problems for the oriented hypercube (Q2667743) (← links)
- Turán numbers of Berge trees (Q2685321) (← links)
- Hypercube 1-factorizations from extended Hamming codes (Q2851530) (← links)
- More about sparse halves in triangle-free graphs (Q3391027) (← links)
- On the Number of Cycles in a Graph with Restricted Cycle Lengths (Q4602855) (← links)
- A Note on Induced Ramsey Numbers (Q4604379) (← links)
- Efficient Testing without Efficient Regularity (Q4993324) (← links)
- An efficient container lemma (Q5144433) (← links)
- Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570) (← links)
- Saturated Subgraphs of the Hypercube (Q5366933) (← links)
- On even-cycle-free subgraphs of the hypercube (Q5891227) (← links)
- On even-cycle-free subgraphs of the hypercube (Q5892562) (← links)
- Induced Ramsey-type theorems (Q5900433) (← links)
- On the inducibility of cycles (Q5916268) (← links)
- Triangles in C5‐free graphs and hypergraphs of girth six (Q6056790) (← links)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808) (← links)
- LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS (Q6082048) (← links)
- Stability version of Dirac's theorem and its applications for generalized Turán problems (Q6096834) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets (Q6172311) (← links)
- Ramsey numbers for multiple copies of sparse graphs (Q6565813) (← links)
- On the generalized Turán problem for odd cycles (Q6606915) (← links)
