Pages that link to "Item:Q3337470"
From MaRDI portal
The following pages link to On some problems in graph theory, combinatorial analysis and combinatorial number theory (Q3337470):
Displaying 19 items.
- Minimizing the number of 5-cycles in graphs with given edge-density (Q5222570) (← links)
- Saturated Subgraphs of the Hypercube (Q5366933) (← links)
- Problems and results on combinatorial number theory (Q5678915) (← 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)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6621212) (← links)
- Spanning subdivisions in Dirac graphs (Q6632797) (← links)
- The inertia bound is far from tight (Q6634558) (← links)
- Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles (Q6642510) (← links)
