The following pages link to Ramin Naimi (Q204023):
Displaying 32 items.
- Spatial graphs with local knots (Q365136) (← links)
- Induced subgraphs of Johnson graphs (Q444598) (← links)
- Complete graphs whose topological symmetry groups are polyhedral (Q538637) (← links)
- Foliations transverse to fibers of Seifert manifolds (Q1327478) (← links)
- Graph manifolds and taut foliations (Q1383652) (← links)
- Escher squares and lattice links (Q1731333) (← links)
- Constructing essential laminations in 2-bridge knot surgered 3-manifolds (Q1816543) (← links)
- Many, many more intrinsically knotted graphs (Q2453739) (← links)
- The Y-triangle move does not preserve intrinsic knottedness (Q2482300) (← links)
- Topological symmetry groups of graphs embedded in the 3-sphere (Q2483783) (← links)
- Delta diagrams (Q2827429) (← links)
- List coloring and \(n\)-monophilic graphs. (Q2828918) (← links)
- Classification of topological symmetry groups of \(K_n\) (Q2862931) (← links)
- Maximizing the Chances of a Color Match (Q2876873) (← links)
- On the number of links in a linearly embedded K<sub>3,3,1</sub> (Q2947790) (← links)
- A Tree That's Not a Tree (Q3103493) (← links)
- TOPOLOGICAL SYMMETRY GROUPS OF COMPLETE GRAPHS IN THE 3-SPHERE (Q3377412) (← links)
- Intrinsic linking and knotting are arbitrarily complex (Q3530834) (← links)
- (Q4307575) (← links)
- INTRINSICALLY n-LINKED GRAPHS (Q4541065) (← links)
- Recent developments in spatial graph theory (Q4635094) (← links)
- (Q5000951) (← links)
- Intrinsic linking and knotting are arbitrarily complex in directed graphs (Q5035316) (← links)
- The complement problem for linklessly embeddable graphs (Q5050621) (← links)
- A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation (Q5244181) (← links)
- Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph (Q5244578) (← links)
- An Algorithm for Detecting Intrinsically Knotted Graphs (Q5418071) (← links)
- Linear embeddings of K<sub>9</sub> are triple linked (Q5420651) (← links)
- Intrinsically triple linked complete graphs (Q5943951) (← links)
- New bounds on maximal linkless graphs (Q6148480) (← links)
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets (Q6172311) (← links)
- Intrinsically knotted graphs with linklessly embeddable simple minors (Q6383248) (← links)
