Attachment 'quickref-graphtheory.tex'

Download

latex error! exitcode was 1 (signal 0), transscript follows:

This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=latex)
entering extended mode
(./latex_01ad332aace8c62a343cb7b61eb11d24b5eb4f98_p.tex
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 2 languages loaded.
(/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size12.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/inputenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/utf8.def
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.dfu)
(/usr/share/texlive/texmf-dist/tex/latex/base/ot1enc.dfu)
(/usr/share/texlive/texmf-dist/tex/latex/base/omsenc.dfu)))
No file latex_01ad332aace8c62a343cb7b61eb11d24b5eb4f98_p.aux.

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.20 \documentclass
                   {article}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.21 \usepackage
                {graphicx}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.22 \usepackage
                [landscape]{geometry}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.23 \usepackage
                [pdftex]{color}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.24 \usepackage
                {url}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.25 \usepackage
                {multicol}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.26 \usepackage
                {amsmath}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.27 \usepackage
                {amsfonts}

! LaTeX Error: Can be used only in preamble.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.44 \begin{document}
                     

! LaTeX Error: Environment multicols* undefined.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.45 \begin{multicols*}
                       {3}
! Undefined control sequence.
<recently read> \url 
                     
l.50 \url
         {http://wiki.sagemath.org/quickref}\\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.57 {\warn
            Adjacency Mapping}: \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.58 {\ex
         \verb$G=Graph([GF(13), lambda i,j: conditions on i,j])$}\\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.61 {\warn
            Adjacency Lists}: \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.62 {\ex
         \verb!G=Graph({0:[1,2,3], 2:[4]})!} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.63 {\ex
         \verb!G=Graph({0:{1:"x",2:"z",3:"a"}, 2:{5:"out"}})!}\\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.66 {\warn
            Adjacency Matrix}: \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.67 {\ex
         \verb!A = numpy.array([[0,1,1],[1,0,1],[1,1,0]])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.70 {\ex
         \verb!M = Matrix([(....), (....), . . . ])!} \\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.71 {\warn
            Edge List with or without labels}: \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.72 {\ex
         \verb!G = Graph([(1,3,"Label"),(3,8,"Or"),(5,2)])!} \\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.73 {\warn
            Incidence Matrix}:\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.74 {\ex
         \verb! M = Matrix(2, [-1,0,0,0,1, 1,-1,0,0,0]) !} \\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.75 {\warn
            Graph6 Or Sparse6 string} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.76 {\ex
         \verb!G=':IgMoqoCUOqeb\n:I`EDOAEQ?PccSsge\N\n'!
! Undefined control sequence.
\ex ->\color 
             {blue}
l.77  \ex
         \verb!graphs_list.from_sparse6(G)!} \\

Overfull \hbox (69.41917pt too wide) in paragraph at lines 70--79
\OT1/cmr/m/n/12 blue[]\OT1/cmtt/m/n/12 G=':IgMoqoCUOqeb\n:I`EDOAEQ?PccSsge\N\n'
 \OT1/cmr/m/n/12 blue[]\OT1/cmtt/m/n/12 graphs_list.from_sparse6(G) 
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.80 {\warn
            NetworkX Graph} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.81 {\ex
         \verb!g = networkx.Graph({0:[1,2,3], 2:[4]})!
! Undefined control sequence.
\ex ->\color 
             {blue}
l.82  \ex
         \verb!DiGraph(g)!} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.83 {\ex
         \verb!g_2 = networkx.MultiGraph({0:[1,2,3], 2:[4]})!
! Undefined control sequence.
\ex ->\color 
             {blue}
l.84 \ex
        \verb!Graph(g_2)!} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.89 {\ex
         \verb!G.centrality_betweenness(normalized=False)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.90 {\ex
         \verb!G.centrality_closeness(v=1)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.91 {\ex
         \verb!G.centrality_degree()!} \\
[1]
! Undefined control sequence.
\ex ->\color 
             {blue}
l.94 {\ex
         \verb!G.add_cycle([vertices])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.95 {\ex
         \verb!G.add_edge(edge)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.96 {\ex
         \verb!G.add_edges(iterable of edges)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.97 {\ex
         \verb!G.add_path!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.98 {\ex
         \verb!G.add_vertex(Name of isolated vertex)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.99 {\ex
         \verb!G.add_vertices(iterable of vertices)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.100 {\ex
          \verb!G.delete_edge( v_1, v_2, 'label')!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.101 {\ex
          \verb!G.delete_edges(iterable of edges)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.102 {\ex
          \verb!G.delete_multiedge(v_1, v_2)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.103 {\ex
          \verb!G.delete_vertex(v_1)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.104 {\ex
          \verb!G.delete_vertices(iterable of vertices)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.105 {\ex
          \verb!G.merge_vertices([vertices])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.108 {\ex
          \verb!G.is_connected()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.109 {\ex
          \verb!G.edge_connectivity()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.110 {\ex
          \verb!G.edge_cut(source, sink!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.111 {\ex
          \verb!G.blocks_and_cut_vertices()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.112 {\ex
          \verb!G.max_cut()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.113 {\ex
          \verb!G.edge_disjoint_paths(v1,v2, method='LP')!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.116 {\ex
          \verb!vertex_disjoint_paths(v1,v2)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.117 {\ex
          \verb!G.flow(1,2)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.122 {\ex
          \verb!G.to_directed()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.123 {\ex
          \verb!G.to_undirected()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.124 {\ex
          \verb!G.sparse6_string()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.125 {\ex
          \verb!G.graph6_string()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.128 {\ex
          \verb!G.strong_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.129 {\ex
          \verb!G.tensor_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.130 {\ex
          \verb!G.categorical_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.133 {\ex
          \verb!G.disjunctive_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.134 {\ex
          \verb!G.lexicographic_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.135 {\ex
          \verb!G.cartesian_product(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.138 {\ex
          \verb!G.is_tree()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.139 {\ex
          \verb!G.is_forest()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.140 {\ex
          \verb!G.is_gallai_tree()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.141 {\ex
          \verb!G.is_interval()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.142 {\ex
          \verb!G.is_regular()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.143 {\ex
          \verb!G.is_chordal()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.144 {\ex
          \verb!G.is_eulerian()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.145 {\ex
          \verb!G.is_hamiltonian()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.146 {\ex
          \verb!G.is_interval()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.147 {\ex
          \verb!G.is_independent_set([vertices])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.148 {\ex
          \verb!G.is_overfull()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.149 {\ex
          \verb!G.is_regular(k)!}\\
[2]
! Undefined control sequence.
\ex ->\color 
             {blue}
l.154 {\ex
          \verb!G.diameter()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.155 {\ex
          \verb!G.average_distance()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.156 {\ex
          \verb!G.edge_disjoint_spanning_trees(k)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.157 {\ex
          \verb!G.girth()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.158 {\ex
          \verb!G.size()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.159 {\ex
          \verb!G.order()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.160 {\ex
          \verb!G.radius()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.163 {\ex
          \verb!G.chromatic_polynomial()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.164 {\ex
          \verb!G.chromatic_number(algorithm="DLX")!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.167 {\ex
          \verb!G.coloring(algorithm="DLX")!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.170 {\ex
          \verb!G.is_perfect(certificate=False)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.173 {\ex
          \verb!G.is_planar()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.174 {\ex
          \verb!G.is_circular_planar()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.175 {\ex
          \verb!G.is_drawn_free_of_edge_crossings()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.176 {\ex
          \verb!G.layout_planar(test=True, set_embedding=True!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.177 {\ex
          \verb!G.set_planar_positions()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.180 {\ex
          \verb!list(G.depth_first_search([vertices], distance=4)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.181 {\ex
          \verb!list(G.breadth_first_search([vertices])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.182 {\ex
          \verb!dist,pred = graph.shortest_path_all_pairs(by_weight=True, al...


Overfull \hbox (94.66667pt too wide) in paragraph at lines 180--184
\OT1/cmr/m/n/12 blue[]\OT1/cmtt/m/n/12 dist,pred = graph.shortest_path_all_pair
s(by_weight=True, algorithm="auto") 
! Undefined control sequence.
\ex ->\color 
             {blue}
l.185 {\ex
          \verb!G.shortest_path_length(v_1,v_2, by_weight=True!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.186 {\ex
          \verb!G.shortest_path_lengths(v_1)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.187 {\ex
          \verb!G.shortest_path(v_1,v_2)!}\\
[3]
! Undefined control sequence.
\ex ->\color 
             {blue}
l.190 {\ex
          \verb!G.steiner_tree(g.vertices()[:10])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.191 {\ex
          \verb!G.spanning_trees_count()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.192 {\ex
          \verb!G.edge_disjoint_spanning_trees(2, root vertex)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.193 {\ex
          \verb!G.min_spanning_tree(weight_function=somefunction,!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.194 {\ex
          \verb!algorithm='Kruskal',starting_vertex=3)!}\\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.199 {\warn
             Matrices}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.200 {\ex
          \verb!G.kirchhoff_matrix()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.201 {\ex
          \verb!G.laplacian_matrix()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.204 {\ex
          \verb!G.weighted_adjacency_matrix()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.205 {\ex
          \verb!G.adjacency_matrix()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.206 {\ex
          \verb!G.incidence_matrix()!}\\
! Undefined control sequence.
\warn ->\bf \color 
                   {red}
l.207 {\warn
             Operations}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.208 {\ex
          \verb!G.characteristic_polynomial()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.209 {\ex
          \verb!G.cycle_basis()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.210 {\ex
          \verb!G.spectrum()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.211 {\ex
          \verb!G.eigenspaces(laplacian=True)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.212 {\ex
          \verb!G.eigenvectors(laplacian=True)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.215 {\ex
          \verb!G.automorphism_group()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.216 {\ex
          \verb!G.is_isomorphic(H)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.217 {\ex
          \verb!G.is_vertex_transitive()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.218 {\ex
          \verb!G.canonical_label()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.219 {\ex
          \verb!G.minor(graph of minor to find)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.222 {\ex
          \verb!G.cluster_transitivity()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.223 {\ex
          \verb!G.cluster_triangles()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.224 {\ex
          \verb!G.clustering_average()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.225 {\ex
          \verb!G..clustering_coeff(nbunch=[0,1,2],weights=True)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.228 {\ex
          \verb!G.is_clique([vertices])!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.229 {\ex
          \verb!G.cliques_vertex_clique_number(vertices=[(0, 1), (1, 2)],alg...


Overfull \hbox (113.19168pt too wide) in paragraph at lines 228--231
\OT1/cmr/m/n/12 blue[]\OT1/cmtt/m/n/12 G.cliques_vertex_clique_number(vertices=
[(0, 1), (1, 2)],algorithm="networkx") 
! Undefined control sequence.
\ex ->\color 
             {blue}
l.232 {\ex
          \verb!G.cliques_number_of()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.233 {\ex
          \verb!G.cliques_maximum()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.234 {\ex
          \verb!G.cliques_maximal()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.235 {\ex
          \verb!G.cliques_get_max_clique_graph()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.236 {\ex
          \verb!G.cliques_get_clique_bipartite()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.237 {\ex
          \verb!G.cliques_containing_vertex()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.238 {\ex
          \verb!G.clique_number(algorithm="cliquer")!}\\
[4]
! Undefined control sequence.
\ex ->\color 
             {blue}
l.241 {\ex
          \verb!G.clique_maximum()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.242 {\ex
          \verb!G.clique_complex()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.245 {\ex
          \verb!G.is_connected()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.246 {\ex
          \verb!G.connected_component_containing_vertex(vertex)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.247 {\ex
          \verb!G.connected_components_number()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.248 {\ex
          \verb!G.connected_components_subgraphs()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.249 {\ex
          \verb!G.strong_orientation()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.250 {\ex
          \verb!G.strongly_connected_components()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.251 {\ex
          \verb!G.strongly_connected_components_digraph()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.252 {\ex
          \verb!G.strongly_connected_components_subgraphs()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.253 {\ex
          \verb!G.strongly_connected_component_containing_vertex(vertex)!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.254 {\ex
          \verb!G.is_strongly_connected()!} \\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.257 {\ex
          \verb!G.vertex_cover(algorithm='Cliquer')!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.260 {\ex
          \verb!G.hamiltonian_cycle()!}\\
! Undefined control sequence.
\ex ->\color 
             {blue}
l.261 {\ex
          \verb!G.traveling_salesman_problem()!}\\

! LaTeX Error: \begin{document} on input line 44 ended by \end{multicols*}.

See the LaTeX manual or LaTeX Companion for explanation.
Type  H <return>  for immediate help.
 ...                                              
                                                  
l.263 \end{multicols*}
                      

Underfull \hbox (badness 10000) in paragraph at lines 260--264

[5] (./latex_01ad332aace8c62a343cb7b61eb11d24b5eb4f98_p.aux) )
(\end occurred inside a group at level 1)

### semi simple group (level 1) entered at line 44 (\begingroup)
### bottom level
(see the transcript file for additional information)
Output written on latex_01ad332aace8c62a343cb7b61eb11d24b5eb4f98_p.dvi (5 pages
, 8768 bytes).
Transcript written on latex_01ad332aace8c62a343cb7b61eb11d24b5eb4f98_p.log.

Attached Files

To refer to attachments on a page, use attachment:filename, as shown below in the list of files. Do NOT use the URL of the [get] link, since this is subject to change and can break easily.

You are not allowed to attach a file to this page.