text:
Perfect graph

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph. In all graphs, the chromatic number is greater than or equal to the size of the maximum clique, but they can be far apart. A graph is perfect when these numbers are equal, and remain equal after the deletion of arbitrary subsets of vertices.

The perfect graphs include many important families of graphs and serve to unify results relating colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time, despite their greater complexity for non-perfect graphs. In addition, several important minimax theorems in combinatorics, including Dilworth's theorem and Mirsky's theorem on partially ordered sets, Kőnig's theorem on matchings, and the Erdős–Szekeres theorem on monotonic sequences, can be expressed in terms of the perfection of certain associated graphs.

The perfect graph theorem states that the complement graph of a perfect graph is also perfect. The strong perfect graph theorem characterizes the perfect graphs in terms of certain forbidden induced subgraphs, leading to a polynomial time algorithm for testing whether a graph is perfect.

Definitions and characterizations
A clique in an undirected graph is a subset of its vertices that are all adjacent to each other, such as the subsets of vertices connected by heavy edges in the illustration. The clique number is the number of vertices in the largest clique: two in the illustrated seven-vertex cycle, and three in the other graph shown. A graph coloring assigns a color to each vertex so that each two adjacent vertices have different colors, also shown in the illustration. The chromatic number of a graph is the minimum number of colors in any coloring. The colorings shown are optimal, so the chromatic number is three for the 7-cycle and four for the other graph shown. The vertices of any clique must have different colors, so the chromatic number is always greater than or equal to the clique number. For some graphs, they are equal; for others, such as the ones shown, they are unequal. The perfect graphs are defined as the graphs for which these two numbers are equal, not just in the graph itself, but in every induced subgraph obtained by deleting some of its vertices.

The perfect graph theorem asserts that the complement graph of a perfect graph is itself perfect. The complement graph has an edge between two vertices if and only if the given graph does not. A clique, in the complement graph, corresponds to an independent set in the given. A coloring of the complement graph corresponds to a clique cover, a partition of the vertices of the given graph into cliques. The fact that the complement of a perfect graph $$G$$ is also perfect implies that, in $$G$$ itself, the independence number (the size of its maximum independent set), equals its clique cover number (the fewest number of cliques needed in a clique cover). More strongly, the same thing is true in every induced subgraph of the complement graph. This provides an alternative and equivalent definition of the perfect graphs: they are the graphs for which, in each induced subgraph, the independence number equals the clique cover number.

The strong perfect graph theorem gives a different way of defining perfect graphs, by their structure instead of by their properties. It is based on the existence of cycle graphs and their complements within a given graph. A cycle of odd length, greater than three, is not perfect: its clique number is two, but its chromatic number is three. By the perfect graph theorem, the complement of an odd cycle of length greater than three is also not perfect. The complement of a length-5 cycle is another length-5 cycle, but for larger odd lengths the complement is not a cycle; it is called an anticycle. The strong perfect graph theorem asserts that these are the only forbidden induced subgraphs for the perfect graphs: a graph is perfect if and only if its induced subgraphs include neither an odd cycle nor an odd anticycle of five or more vertices. In this context, induced cycles that are not triangles are called "holes", and their complements are called "antiholes", so the strong perfect graph theorem can be stated more succinctly: a graph is perfect if and only if it has neither an odd hole nor an odd antihole.

These results can be combined in another characterization of perfect graphs: they are the graphs for which the product of the clique number and independence number is greater than or equal to the number of vertices, and for which the same is true for all induced subgraphs. Because the statement of this characterization remains invariant under complementation of graphs, it implies the perfect graph theorem. One direction of this characterization follows easily from the original definition of perfect: the number of vertices in any graph equals the sum of the sizes of the color classes in an optimal coloring, and is less than or equal to the number of colors multiplied by the independence number. In a perfect graph, the number of colors equals the clique number, and can be replaced by the clique number in this inequality. The other direction can be proved directly, but it also follows from the strong perfect graph theorem: if a graph is not perfect, it contains an odd cycle or its complement, and in these subgraphs the product of the clique number and independence number is one less than the number of vertices.

History
The theory of perfect graphs developed from a 1958 result of Tibor Gallai that in modern language can be interpreted as stating that the complement of a bipartite graph is perfect; this result can also be viewed as a simple equivalent of Kőnig's theorem, a much earlier result relating matchings and vertex covers in bipartite graphs. The first formulation of the concept of perfect graphs more generally was in a 1961 paper by Claude Berge, in German, and the first use of the phrase "perfect graph" appears to be in a 1963 paper of Berge. In these works he unified Gallai's result with several similar results by defining perfect graphs, and he conjectured both the perfect graph theorem and the strong perfect graph theorem. In formulating these concepts, Berge was motivated by the concept of the Shannon capacity of a graph, by the fact that for (co-)perfect graphs it equals the independence number, and by the search for minimal examples of graphs for which this is not the case. Until the strong perfect graph theorem was proven, the graphs described by it (that is, the graphs with no odd hole and no odd antihole) were called Berge graphs.

The perfect graph theorem was proven by László Lovász in 1972, who in the same year proved the stronger inequality between the number of vertices and the product of the clique number and independence number, without benefit of the strong perfect graph theorem. In 1991, Alfred Lehman won the Fulkerson Prize, sponsored jointly by the Mathematical Optimization Society and American Mathematical Society, for his work on generalizations of the theory of perfect graphs to logical matrices. The conjectured strong perfect graph theorem became the focus of research in the theory of perfect graphs for many years, until its proof was announced in 2002 by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, and published by them in 2006. This work won its authors the 2009 Fulkerson Prize. The perfect graph theorem has a short proof, but the proof of the strong perfect graph theorem is long and technical, based on a deep structural decomposition of Berge graphs. Related decomposition techniques have also borne fruit in the study of other graph classes, and in particular for the claw-free graphs. The symmetric characterization of perfect graphs in terms of the product of clique number and independence number was originally suggested by Hajnal and proven by Lovász.

Families of graphs
Many well-studied families of graphs are perfect, and in many cases the fact that these graphs are perfect corresponds to a minimax theorem for some kinds of combinatorial structure defined by these graphs. Examples of this phenomenon include the perfection of bipartite graphs and their line graphs, associated with Kőnig's theorem relating maximum matchings and vertex covers in bipartite graphs, and the perfection of comparability graphs, associated with Dilworth's theorem and Mirsky's theorem on chains and antichains in partially ordered sets. Other important classes of graphs, defined by having a structure related to the holes and antiholes of the strong perfect graph theorem, include the chordal graphs, Meyniel graphs, and their subclasses.

Bipartite graphs and line graphs
In bipartite graphs (with at least one edge) the chromatic number and clique number both equal two. Their induced subgraphs remain bipartite, so bipartite graphs are perfect. Other important families of graphs are bipartite, and therefore also perfect, including for instance the trees and median graphs. By the perfect graph theorem, maximum independent sets in bipartite graphs have the same size as their minimum clique covers. The maximum independent set is complementary to a minimum vertex cover, a set of vertices that touches all edges. A minimum clique cover consists of a maximum matching (as many disjoint edges as possible) together with one-vertex cliques for all remaining vertices, and its size is the number of vertices minus the number of matching edges. Therefore, this equality can be expressed equivalently as an equality between the size of the maximum matching and the minimum vertex cover in bipartite graphs, the usual formulation of Kőnig's theorem.

A matching, in any graph $$G$$, is the same thing as an independent set in the line graph $$L(G)$$, a graph that has a vertex for each edge in $$G$$ and an edge between two vertices in $$L(G)$$ for each pair of edges in $$G$$ that share an endpoint. Line graphs have two kinds of cliques: sets of edges in $$G$$ with a common endpoint, and triangles in $$G$$. In bipartite graphs, there are no triangles, so a clique cover in $$L(G)$$ corresponds to a vertex cover in $$G$$. Therefore, in line graphs of bipartite graphs, the independence number and clique cover number are equal. Induced subgraphs of line graphs of bipartite graphs are line graphs of subgraphs, so the line graphs of bipartite graphs are perfect. Examples include the rook's graphs, the line graphs of complete bipartite graphs. Every line graph of a bipartite graph is an induced subgraph of a rook's graph.

Because line graphs of bipartite graphs are perfect, their clique number equals their chromatic number. The clique number of the line graph of a bipartite graph is the maximum degree of any vertex of the underlying bipartite graph. The chromatic number of the line graph of a bipartite graph is the chromatic index of the underlying bipartite graph, the minimum number of colors needed to color the edges so that touching edges have different colors. Each color class forms a matching, and the chromatic index is the minimum number of matchings needed to cover all edges. The equality of maximum degree and chromatic index, in bipartite graphs, is another theorem of Dénes Kőnig. In arbitrary simple graphs, they can differ by one; this is Vizing's theorem.

The underlying graph $$G$$ of a perfect line graph $$L(G)$$ is a line perfect graph. These are the graphs whose biconnected components are bipartite graphs, the complete graph $$K_4$$, and triangular books, sets of triangles sharing an edge. These components are perfect, and their combination preserves perfection, so every line perfect graph is perfect.

The bipartite graphs, their complements, and the line graphs of bipartite graphs and their complements form four basic classes of perfect graphs that play a key role in the proof of the strong perfect graph theorem. According to the structural decomposition of perfect graphs used as part of this proof, every perfect graph that is not already in one of these four classes can be decomposed by partitioning its vertices into subsets, in one of four ways, called a 2-join, the complement of a 2-join, a homogeneous pair, or a skew partition.

Comparability graphs
A partially ordered set is defined by its set of elements, and a comparison relation $$\le$$ that is reflexive (for all elements $$x$$, $$x\le x$$), antisymmetric (if $$x\le y$$ and $$y\le x$$, then $$x=y$$, and transitive (if $$x\le y$$ and $$y\le z$$, then $$x\le z$$). Elements $$x$$ and $$y$$ are comparable if $$x\le y$$ or $$y\le x$$, and incomparable otherwise. For instance, set inclusion ($$\subseteq$$) partially orders any family of sets. The comparability graph of a partially ordered set has the set elements as its vertices, with an edge connecting any two comparable elements. Its complement is called an incomparability graph. Different partial orders may have the same comparability graph; for instance, reversing all comparisons changes the order but not the graph.

Finite comparability graphs (and their complementary incomparability graphs) are always perfect. A clique, in a comparability graph, comes from a subset of elements that are all pairwise comparable; such a subset is called a chain, and it is linearly ordered by the given partial order. An independent set comes from a subset of elements no two of which are comparable; such a subset is called an antichain. For instance, in the illustrated partial order and comparability graph, $$\{A,B,C\}$$ is a chain in the order and a clique in the graph, while $$\{C,D\}$$ is an antichain in the order and an independent set in the graph. Thus, a coloring of a comparability graph is a partition of its elements into antichains, and a clique cover is a partition of its elements into chains. Dilworth's theorem, in the theory of partial orders, states that for every finite partial order, the size of the largest antichain equals the minimum number of chains into which the elements can be partitioned. In the language of graphs, this can be stated as: every finite comparability graph is perfect. Similarly, Mirsky's theorem states that for every finite partial order, the size of the largest chain equals the minimum number of antichains into which the elements can be partitioned, or that every finite incomparability graph is perfect. These two theorems are equivalent via the perfect graph theorem, but Mirsky's theorem is easier to prove directly than Dilworth's theorem: if each element is labeled by the size of the largest chain in which it is maximal, then the subsets with equal labels form a partition into antichains, with the number of antichains equal to the size of the largest chain overall. Every bipartite graph is a comparability graph. Thus, Kőnig's theorem can be seen as a special case of Dilworth's theorem, connected through the theory of perfect graphs.

A permutation graph is defined from a permutation on a totally ordered sequence of elements (conventionally, the integers from $$1$$ to $$n$$), which form the vertices of the graph. The edges of a permutation graph connect pairs of elements whose ordering is reversed by the given permutation. These are naturally incomparability graphs, for a partial order in which $$x\le y$$ whenever $$x$$ occurs before $$y$$ in both the given sequence and its permutation. The complement of a permutation graph is another permutation graph, for the reverse of the given permutation. Therefore, as well as being incomparability graphs, permutation graphs are comparability graphs. In fact, the permutation graphs are exactly the graphs that are both comparability and incomparability graphs. A clique, in a permutation graph, is a subsequence of elements that appear in increasing order in the given permutation, and an independent set is a subsequence of elements that appear in decreasing order. In any perfect graph, the product of the clique number and independence number are at least the number of vertices; the special case of this inequality for permutation graphs is the Erdős–Szekeres theorem.

The interval graphs are the incomparability graphs of interval orders, orderings defined by sets of intervals on the real line with $$x\le y$$ whenever interval $$x$$ is completely to the left of interval $$y$$. In the corresponding interval graph, there is an edge from $$x$$ to $$y$$ whenever the two intervals have a point in common. Coloring these graphs can be used to model problems of assigning resources to tasks (such as classrooms to classes) with intervals describing the scheduled time of each task. Both interval graphs and permutation graphs are generalized by the trapezoid graphs. Systems of intervals in which no two are nested produce a more restricted class of graphs, the indifference graphs, the incomparability graphs of semiorders. These have been used to model human preferences under the assumption that, when items have utilities that are very close to each other, they will be incomparable. Intervals where every pair is nested or disjoint produce trivially perfect graphs, the comparability graphs of ordered trees. In them, the independence number equals the number of maximal cliques.

Split graphs and random perfect graphs
A split graph is a graph that can be partitioned into a clique and an independent set. It can be colored by assigning a separate color to each vertex of a maximal clique, and then coloring each remaining vertex the same as a non-adjacent clique vertex. Therefore, these graphs have equal clique numbers and chromatic numbers, and are perfect. A broader class of graphs, the unipolar graphs can be partitioned into a clique and a cluster graph, a disjoint union of cliques. These include also the bipartite graphs, for which the cluster graph is just a single clique. The unipolar graphs and their complements together form the class of generalized split graphs. Almost all perfect graphs are generalized split graphs, in the sense that the fraction of perfect $$n$$-vertex graphs that are generalized split graphs goes to one in the limit as $$n$$ grows arbitrarily large.

Other limiting properties of almost all perfect graphs can be determined by studying the generalized split graphs. In this way, it has been shown that almost all perfect graphs contain a Hamiltonian cycle. If $$H$$ is an arbitrary graph, the limiting probability that $$H$$ occurs as an induced subgraph of a large random perfect graph is 0, 1/2, or 1, respectively as $$H$$ is not a generalized split graph, is unipolar or co-unipolar but not both, or is both unipolar and co-unipolar.

Incremental constructions
Several families of perfect graphs can be characterized by an incremental construction in which the graphs in the family are built up by adding one vertex at a time, according to certain rules, which guarantee that after each vertex is added the graph remains perfect.
 * The chordal graphs are the graphs formed by a construction of this type in which, at the time a vertex is added, its neighbors form a clique. Chordal graphs may also be characterized as the graphs that have no holes (even or odd). They include as special cases the forests, the interval graphs, and the maximal outerplanar graphs. The split graphs are exactly the graphs that are chordal and have a chordal complement. The $k$-trees, central to the definition of treewidth, are chordal graphs formed by starting with a $(k + 1)$-vertex clique and repeatedly adding a vertex so that it and its neighbors form a clique of the same size.
 * The distance-hereditary graphs are formed, starting from a single-vertex graph, by repeatedly adding degree-one vertices ("pendant vertices") or copies of existing vertices (with the same neighbors). Each vertex and its copy may be adjacent (true twins) or non-adjacent (false twins). In every connected induced subgraph of these graphs, the distances between vertices are the same as in the whole graph. If only the twin operations are used, the result is a cograph. The cographs are the comparability graphs of series-parallel partial orders and can also be formed by a different construction process combining complementation and the disjoint union of graphs.
 * The graphs that are both chordal and distance-hereditary are called Ptolemaic graphs, because their distances obey Ptolemy's inequality. They have a restricted form of the distance-hereditary construction sequence, in which a false twin can only be added when its neighbors would form a clique. They include as special cases the windmill graphs consisting of cliques joined at a single vertex, and the block graphs in which each biconnected component is a clique.
 * The threshold graphs are formed from an empty graph by repeatedly adding either an isolated vertex (connected to nothing else) or a universal vertex (connected to all other vertices). They are special cases of the split graphs and the trivially perfect graphs. They are exactly the graphs that are both trivially perfect and the complement of a trivially perfect graph; they are also exactly the graphs that are both cographs and split graphs.

If the vertices of a chordal graph are colored in the order of an incremental construction sequence using a greedy coloring algorithm, the result will be an optimal coloring. The reverse of the vertex ordering used in this construction is called an elimination order. Similarly, if the vertices of a distance-hereditary graph are colored in the order of an incremental construction sequence, the resulting coloring will be optimal. If the vertices of a comparability graph are colored in the order of a linear extension of its underlying partial order, the resulting coloring will be optimal. This property is generalized in the family of perfectly orderable graphs, the graphs for which there exists an ordering that, when restricted to any induced subgraph, causes greedy coloring to be optimal. The cographs are exactly the graphs for which all vertex orderings have this property. Another subclass of perfectly orderable graphs are the complements of tolerance graphs, a generalization of interval graphs.

Strong perfection
The strongly perfect graphs are graphs in which, in every induced subgraph, there exists an independent set that intersects all maximal cliques. In the Meyniel graphs or very strongly perfect graphs, every vertex belongs to such an independent set. The Meyniel graphs can also be characterized as the graphs in which every odd cycle of length five or more has at least two chords.

A parity graph is defined by the property that between every two vertices, all induced paths have equal parity: either they are all even in length, or they are all odd in length. These include the distance-hereditary graphs, in which all induced paths between two vertices have the same length, and bipartite graphs, for which all paths (not just induced paths) between any two vertices have equal parity. Parity graphs are Meyniel graphs, and therefore perfect: if a long odd cycle had only one chord, the two parts of the cycle between the endpoints of the chord would be induced paths of different parity. The prism over any parity graph (its Cartesian product with a single edge) is another parity graph, and the parity graphs are the only graphs whose prisms are perfect.

Matrices, polyhedra, and integer programming
Perfect graphs are closely connected to the theory of linear programming and integer programming. Both linear programs and integer programs are expressed in canonical form as seeking a vector $$x$$ that maximizes a linear objective function $$c\cdot x$$, subject to the linear constraints $$x\ge 0$$ and $$Ax\le b$$. Here, $$A$$ is given as a matrix, and $$b$$ and $$c$$ are given as two vectors. Although linear programs and integer programs are specified in this same way, they differ in that, in a linear program, the solution vector $$x$$ is allowed to have arbitrary real numbers as its coefficients, whereas in an integer program these unknown coefficients must be integers. This makes a very big difference in the computational complexity of these problems: linear programming can be solved in polynomial time, but integer programming is NP-hard.

When the same given values $$A$$, $$b$$, and $$c$$ are used to define both a linear program and an integer program, they commonly have different optimal solutions. The linear program is called an integral linear program if an optimal solution to the integer program is also optimal for the linear program. (Otherwise, the ratio between the two solution values is called the integrality gap, and is important in analyzing approximation algorithms for the integer program.) Perfect graphs may be used to characterize the (0, 1) matrices $$A$$ (that is, matrices where all coefficients are 0 or 1) with the following property: if $$b$$ is the all-ones vector, then for all choices of $$c$$ the resulting linear program is integral.

As Václav Chvátal proved, every matrix $$A$$ with this property is (up to removal of irrelevant "dominated" rows) the maximal clique versus vertex incidence matrix of a perfect graph. This matrix has a column for each vertex of the graph, and a row for each maximal clique, with a coefficient that is one in the columns of vertices that belong to the clique and zero in the remaining columns. The integral linear programs encoded by this matrix seek the maximum-weight independent set of the given graph, with weights given by the vector $$c$$.

For a matrix $$A$$ defined in this way from a perfect graph, the vectors $$x$$ satisfying the system of inequalities $$x\ge 0$$, $$Ax\le 1$$ form an integral polytope. It is the convex hull of the indicator vectors of independent sets in the graph, with facets corresponding to the maximal cliques in the graph. The perfect graphs are the only graphs for which the two polytopes defined in this way from independent sets and from maximal cliques coincide.

Algorithms
In all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time. The algorithm for the general case involves the Lovász number of these graphs. The Lovász number of any graph can be determined by labeling its vertices by high dimensional unit vectors, so that each two non-adjacent vertices have perpendicular labels, and so that all of the vectors lie in a cone with as small an opening angle as possible. Then, the Lovász number is $$1/\cos^2\theta$$, where $$\theta$$ is the half-angle of this cone. Despite this complicated definition, an accurate numerical value of the Lovász number can be computed using semidefinite programming, and for any graph the Lovász number is sandwiched between the chromatic number and clique number. Because these two numbers equal each other in perfect graphs, they also equal the Lovász number. Thus, they can be computed by approximating the Lovász number accurately enough and rounding the result to the nearest integer.

The solution method for semidefinite programs, used by this algorithm, is based on the ellipsoid method for linear programming. It leads to a polynomial time algorithm for computing the chromatic number and clique number in perfect graphs. However, solving these problems using the Lovász number and the ellipsoid method is complicated and has a high polynomial exponent. More efficient combinatorial algorithms are known for many special cases.

This method can also be generalized to find the maximum weight of a clique, in a weighted graph, instead of the clique number. A maximum or maximum weight clique itself, and an optimal coloring of the graph, can also be found by these methods, and a maximum independent set can be found by applying the same approach to the complement of the graph. For instance, a maximum clique can be found by the following algorithm: The algorithm for finding an optimal coloring is more complicated, and depends on the duality theory of linear programs, using this clique-finding algorithm as a separation oracle.
 * Loop through the vertices of the graph. For each vertex $$v$$, perform the following steps:
 * Tentatively remove $$v$$ from the graph.
 * Use semidefinite programming to determine the clique number of the resulting induced subgraph.
 * If this clique number is the same as for the whole graph, permanently remove $$v$$; otherwise, restore $$v$$ to the graph.
 * Return the subgraph that remains after all the permanent removals.

Beyond solving these problems, another important computational problem concerning perfect graphs is their recognition, the problem of testing whether a given graph is perfect. For many years the complexity of recognizing Berge graphs and perfect graphs were considered separately (as they were not yet known to be equivalent) and both remained open. They were both known to be in co-NP; for Berge graphs, this follows from the definition, while for perfect graphs it follows from the characterization using the product of the clique number and independence number. After the strong perfect graph theorem was proved, Chudnovsky, Cornuéjols, Liu, Seymour, and Vušković discovered a polynomial time algorithm for testing the existence of odd holes or anti-holes. By the strong perfect graph theorem, this can be used to test whether a given graph is perfect, in polynomial time.

Related concepts
Generalizing the perfect graphs, a graph class is said to be χ-bounded if the chromatic number of the graphs in the class can be bounded by a function of their clique number. The perfect graphs are exactly the graphs for which this function is the identity, both for the graph itself and for all its induced subgraphs.

The equality of the clique number and chromatic number in perfect graphs has motivated the definition of other graph classes, in which other graph invariants are set equal to each other. For instance, the domination perfect graphs are defined as graphs in which, in every induced subgraph, the smallest dominating set (a set of vertices adjacent to all remaining vertices) equals the size of the smallest independent set that is a dominating set. These include, for instance, the claw-free graphs.

title: Perfect graph


text:
University of Cape Town

The University of Cape Town (UCT) (Universiteit van Kaapstad, iYunivesithi yaseKapa) is a public research university in Cape Town, South Africa. Established in 1829 as the South African College, it was granted full university status in 1918, making it the oldest university in South Africa and the oldest university in Sub-Saharan Africa in continuous operation.

UCT is organised in 57 departments across six faculties offering bachelor's (NQF 7) to doctoral degrees (NQF 10) solely in the English language. Home to 30,000 students, it encompasses six campuses in the Capetonian suburbs of Rondebosch, Hiddingh, Observatory, Mowbray, and the Waterfront. It is the only African member of the Global University Leaders Forum (GULF) within the World Economic Forum, which is made up of 26 of the world's top universities.

Five alumni, staff members, and researchers associated with UCT have won the Nobel Prize. 88 staff members are part of the Academy of Sciences of South Africa.

Early history
The University of Cape Town was founded at a meeting in the Groote Kerk in 1829 as the South African College, a high school for young men. The college had a small tertiary-education facility, introduced in 1874 that grew substantially after 1880, when the discovery of gold and diamonds in the north – and the resulting demand for skills in mining – gave it the financial boost it needed to grow. The college developed into a fully fledged university during the period 1880 to 1900, thanks to increased funding from private sources and the government.

During these years, the college built its first dedicated science laboratories, and started the departments of mineralogy and geology to meet the need for skilled personnel in the country's emerging diamond and gold-mining industries. The UCT crest was designed in 1859 by Charles Davidson Bell, Surveyor-General of the Cape Colony at the time. Bell was an accomplished artist who also designed medals and the triangular Cape stamp. Another key development during this period was the admission of women. In 1886 the professor of chemistry, Paul Daniel Hahn, convinced the council to admit four women into his chemistry class on a trial basis. Owing to the exceptional standard of work by the women students, the college decided to admit women students permanently in honour of Queen Victoria's Diamond Jubilee in 1887.

The years 1902 to 1918 saw the establishment of the Medical School, the introduction of engineering courses and a Department of Education. UCT was formally established as a university in 1918, on the basis of the Alfred Beit bequest and additional substantial gifts from mining magnates Julius Wernher and Otto Beit. The new university also attracted substantial support from well-wishers in the Cape Town area and, for the first time, a significant state grant. In 1928, the university was able to move the bulk of its facilities to Groote Schuur on the slopes of Devil's Peak, on land bequeathed to the nation by Cecil John Rhodes as the site for a national university. UCT celebrated its centenary the following year.

Apartheid era
Apart from establishing itself as a leading research and teaching university in the decades that followed, UCT earned itself the nickname "Moscow on the Hill" during the period 1960 to 1990 for its sustained opposition to apartheid, particularly in higher education.

The university admitted its first small group of black students in the 1920s. The number of black students remained relatively low until the 1980s and 90s, when the institution, reading and welcoming the signs of change in the country, committed itself to a deliberate and planned process of internal transformation. From the 1980s to the early 1990s, the number of black students admitted to the university rose by 35 percent. By 2004, nearly half of UCT's 20,000 students were black and just under half of the student body was female. Today the university boasts having one of the most diverse campuses in South Africa.

Post-Apartheid era
Rhodes Must Fall (#RhodesMustFall on social media) was a protest movement that began on 9 March 2015, originally directed against a statue at the University of Cape Town (UCT) that commemorates Cecil Rhodes. The campaign for the statue's removal received global attention and led to a wider movement to "decolonise" education across South Africa. On 9 April 2015, following a UCT Council vote the previous night, the statue was removed.

 * 1) FeesMustFall was a student protest movement which was arguably indirectly inspired by the RhodesMustFall. It formally began at the University of the Witwatersrand and spread to UCT and Rhodes University and then the rest of the South African universities.  It called for the abolition of tuition fee increases for the 2016 academic year. Diverse demands arose such as the abolition of fees and decolonisation of higher education which led to substantial changes at South African public universities. At UCT, the Senate began a widespread curriculum reform process and the university began the process of the renaming of buildings on campus (the most notable example was when Jameson Hall was renamed to Sarah Baartman Hall in 2019).

In September 2019, Film and Media studies student Uyinene Mrwetyana went missing. After the community and police began searching, her body was discovered in the Cape Flats area of Cape Town and Luyanda Botha was arrested and convicted for her rape and murder. Her death and the rape and death of other women precipitated widespread public outcry that led to a campus shutdown and protests on campus, at the Parliament precinct in Cape Town CBD and at campuses around South Africa. Subsequently, President Ramaphosa announced reforms such as harsher punishments for sex offenders and the public disclosure of the National Register for Sex Offenders to stem sexual and physical violence against women and children. Moreover, the Uyinene Mrwetyana Foundation was established and a special fund in her name was created to provide scholarships to female students in the Humanities Faculty.

In March 2020, UCT opened the Neuroscience Institute at the Groote Schuur Hospital in collaboration with the Western Cape Provincial Government, the first dedicated cross- and interdisciplinary centre for the study of and development of treatments for neurological and mental disorders in Africa.

Campus
The main teaching campus, known as Upper Campus, is located on the Rhodes Estate on the slopes of Devil's Peak. This campus contains, in a relatively compact site, the faculties of Science, Engineering, Commerce, and Humanities (except for the arts departments), as well as Smuts Hall and Fuller Hall residences. Upper Campus is centered on Sarah Baartman Hall, the location for graduation and other ceremonial events, as well as many examinations. The original buildings and layout of Upper Campus were designed by JM Solomon and built between 1928 and 1930. Since that time, many more buildings have been added as the university has grown. Upper Campus is also home to the main library, The Chancellor Oppenheimer Library, which holds the majority of the university's 1.3 million volume collection.

Contiguous with Upper Campus, but separated from it by university sports fields and the M3 expressway, are the Middle and Lower Campuses. These campuses, which are spread through the suburbs of Rondebosch, Rosebank and Mowbray, contain the Law Faculty, the South African College of Music, the School of Economics, most of the student residences, most of the university administrative offices, and various sporting facilities. The state of the art artificial grass soccer field has been approved by FIFA for training for World Cup teams. The Upper, Middle and Lower Campuses together are often referred to as the "main campus".

The Faculty of Health Sciences is located on the Medical School campus next to the Groote Schuur Hospital in Observatory. The Fine Arts and Drama departments are located on the Hiddingh Campus in central Cape Town. The university's original building, now known as the Egyptian Building, on the Hiddingh campus, was built in the Egyptian Revival style. The only other campus built in this style was the Medical College of Virginia in Richmond, Virginia in the United States. The UCT Graduate School of Business is located on the Breakwater Lodge Campus at the Victoria & Alfred Waterfront.

The Baxter Theatre Centre, located on the Lower Campus, is part of the University of Cape Town; it is also the second largest performing arts complex in Cape Town, after the Artscape Theatre Centre. It has three venues:
 * the 665-seat Main Theatre
 * the 638-seat Concert Hall, with a Von Beckerath organ
 * the 172-seat Golden Arrow Studio

For his contribution of the tract of land which the campus was founded on, a bronze statue of Cecil Rhodes was erected in 1934 on the Upper Campus, overlooking the university's rugby fields. The statue was removed in April 2015 following pressure from student groups due to its representation of South Africa's colonialist apartheid past and the university's inadequate representation of black students, faculty, and staff.

The upper campus was affected by the Table Mountain fire in April 2021; the Jagger Library building, which housed rare books and documents including a large African Studies collection, was gutted.

Residential halls
The university has 19 student residences (or "res" as known colloquially), offering both single-gender and mixed-gender housing. The Department of Student Housing oversees the residence system College House is the oldest university residence in Africa, having been established in 1887. UCT's residence system is composed of three tiers. Students living in residence are placed in a tier according to the length of time that they have been in the residence system, studying in the university and service or part-time employment in a residence. As a student progresses through their academic journey they are moved into a higher tier. Postgraduate students are usually housed in the third-tier residences unless employed in lower-tier residences.

First-tier residences:

 * Avenue Road Residence
 * Baxter Hall
 * Clarinus Village
 * College House
 * Dullah Omar Hall
 * Fuller Hall
 * Glendover Residence
 * Graça Machel Hall
 * Kilindini
 * Kopano Residence
 * Leo Marquard Hall
 * Rochester House
 * Smuts Hall
 * Tugwell Hall
 * University House
 * Varietas

Second-tier residences:

 * Forest Hill
 * Groote Schuur Flats
 * Groote Schuur Residence
 * Liesbeeck Gardens
 * Medical Residence
 * Obz Square
 * The Woolsack

Third-tier residences:

 * 1 Woodbine Road
 * 8 Avenue Road
 * Amalinda
 * Dullah Omar Hall
 * Edwin Hart Annex
 * F Block (Forest Hill)
 * Harold Cressy Hall
 * Inglewood
 * JP Duminy Court
 * Linkoping
 * North Grange
 * Rondeberg
 * TB Davie Court

Administration and governance
The University of Cape Town was originally incorporated as a public university by a private act of Parliament in 1918. At present it is incorporated and structured by an institutional statute issued under the provisions of the Higher Education Act, 1997.

The titular head of the university is the chancellor; this is a ceremonial position without executive power. The primary role of the chancellor is to confer degrees on behalf of the university, and to represent the university to the rest of the world. The current Chancellor is fashion entrepreneur and philanthropist Precious Moloi-Motsepe who was elected in November 2019 and assumed the role on 1 January 2020 after the expiration of Ms Graça Machel's second consecutive 10-year term.

The University Council is the highest ranked decision-making and appointative structure in the university. With wide-ranging powers of governance over areas such as the strategy, well-being and mission of the university, it is directly accountable to the Government of the Republic through the Minister of Higher Education, currently Nobuhle Nkabane for matters relating to the university. It is composed of 30 broad stakeholder representatives such as students, academics, staff and appointees of the City of Cape Town, Convocation, Premier of the Western Cape and the Minister of Higher Education among others, and the presiding officer of the council, the chair, is currently Mr Norman Arendse (SC). The Registrar, who acts as the secretary of the Council and Senate, oversees academic registration and legal matters, and administers the Convocation, is currently Royston Pillay.

The Convocation, composed of alumni, the Vice Chancellor, Deputy Vice Chancellors, academic staff, emeritus professors and emeritus associate professors, is a statutory body administered by the Office of the Registrar, which provides a platform for former members of the university to participate and engage with matters affecting the university. Helmed by the President of the Convocation, currently Mr Kassi Carl Manlan, it can make recommendations and pass non-binding resolutions in its Annual General Meetings.

The Leadership Lekgotla is a coordinating and decision-making structure composed of senior executives of the university who oversee the day-to-day running of the university. It contrasts with the University Council which arises from the University Statute and exercises supreme governance over the university. The Leadership Lekgotla's members are senior executives who oversee different areas of the university's operations and policies. The most senior executive is the Vice Chancellor (ranked below the Chancellor in the ceremonial protocol and order of precedence of the university) is the de facto head and chief executive of the university, (currently held in an acting capacity since Mamokgethi Phakeng's term was ended on 3 March 2023), who is accountable to the council. Below the Vice Chancellor are the Deputy Vice Chancellors of Transformation (currently Professor Elelwani Ramugondo ), of Research and Internationalisation (currently Susanne Harris ) and of Teaching and Learning (currently Professor Harsha Kathard, acting ). The Chief Operations Officer, currently Reno Morar, brings together and oversees the functional, support and technical areas of the university's operations.

Academic divisions
The university is composed of six Faculties (Commerce, Engineering and the Built Environment, Health Sciences, Law, Sciences and Humanities) which together comprise 57 departments. Faculties are helmed by a Dean and their administrative and operational matters are administered by a Director. The Senate has delegated substantial powers to the faculties in academic matters over their internal protocol and management such as on matters concerning class timetables, admission requirements, academic exclusion, examinations, research projects and so on. Faculties vary substantially in student size and in buildings occupied, with the Commerce faculty having the highest student population and the law faculty having the lowest while the Humanities faculty spans the most buildings followed by the Faculty of Health Sciences with the Commerce and Law faculties having (by far) the lowest physical footprint.

Notwithstanding interdisciplinary research units and centers, additional academic structures exist that eschew the faculty-based organisational structure. The multidisciplinary Center for Higher Education Development ranks on an equal level as the faculties and the UCT Graduate School of Business maintains substantial latitude over its internal affairs despite being nominally part of the Faculty of Commerce. The interdisciplinary School of Information Technology, comprising the Departments of Information Systems and of Computer Science in the Commerce and Science faculties is neither a faculty nor a department but a coordinating mechanism to promote IT education and research.

The departments of the faculties are listed as follows:

Faculty of Commerce
 * College of Accounting
 * School of Economics (jointly established with Faculty of Humanities)
 * Department of Finance and Tax
 * Department of Information Systems
 * The Nelson Mandela School of Public Governance
 * School of Management Studies
 * Education Development Unit
 * Graduate School of Business

Faculty of Engineering and the Built Environment

 * Department of Architecture, Planning and Geomatics
 * Department of Chemical Engineering
 * Department of Civil Engineering
 * Department of Construction Economics and Management
 * Department of Electrical Engineering
 * Department of Mechanical Engineering

Faculty of Health Sciences

 * Department of Anaesthesia and Perioperative Medicine
 * Department of Health and Rehabilitation Sciences
 * Department of Health Sciences Education
 * Department of Human Biology
 * Department of Integrative Biomedical Sciences
 * Department of Medicine
 * Department of Obstetrics and Gynaecology
 * Department of Paediatrics and Child Health
 * Department of Pathology
 * Department of Psychiatry and Mental Health
 * Department of Public Health and Family Medicine
 * Department of Radiation Medicine
 * Department of Surgery

Faculty of Humanities

 * African Feminist Studies
 * Anthropology
 * African Studies and Linguistics
 * Centre for Film and Media Studies
 * Education Development Unit
 * English Literary Studies
 * Historical Studies
 * Knowledge and Information Stewardship
 * Michaelis School of Fine Art
 * Department of Philosophy
 * Department of Political Studies
 * School of Education
 * Department of Psychology
 * School of Languages and Literatures
 * Department of Social Work & Social Development
 * Department of Sociology
 * South African College of Music
 * Department for the Study of Religions
 * Theatre, Dance and Performance Studies

Faculty of Law
 * Department of Commercial Law
 * Department of Private Law
 * Department of Public Law

Faculty of Science

 * Department of Archaeology
 * Department of Astronomy
 * Department of Biological Sciences
 * Department of Chemistry
 * Department of Computer Science
 * Department of Environmental and Geographical Science
 * Department of Geological Sciences
 * Department of Mathematics and Applied Mathematics
 * Department of Molecular and Cell Biology
 * Department of Oceanography
 * Department of Physics
 * Department of Statistical Sciences

Funding
The university's endowment (the financial capital and investment funds on which it can draw to carry out its work) is deposited with the UCT Foundation (a legally independent nonprofit organisation) and it is managed by the Investment Office. Through the Distinguishing UCT fundraising campaign, the university is trying to raise its endowment. As of 2019, its designated endowment stands at R2.5 billion and its undesignated endowment stands at R676 million with R133 million raised for infrastructure projects (bringing the total undesignated endowment to R809 million which the university aims to increase to R1 billion).

There have been several campaigns at the university to divest its endowment. Fossil Free UCT was formally established in 2015 as a campaign by environmental activism lobbying groups and student organisations, most notably the Green Campus Initiative compel UCT to divest from fossil fuel companies which resulted in a non-binding resolution passed by UCT's Convocation in 2017 to support the divestment. Student lobby groups, most notably the Palestinian Solidarity Front and the SRC called on the university's management to divest from Israeli companies and organisations working in the Palestinian Occupied Territories (among other demands), which, in the end, the university refused to do.

The university's income comes from a combination of government grants, tuition fees, donations, investment and research income. In the 2017–2018 financial year, the university received R1.415 billion in state subsidies, R1.428 billion in tuition fees and R539 million in other income. R1.2 billion was committed to student financial aid for both undergraduate and postgraduate students from the university, the government through the NSFAS scheme and the university's partners and donors.

Students and staff
, there were 27,907 students; 25% of whom were black South African, 22% were white South African, 18% identified as another race, 15% were international students. In 2016 there were 29,074 students enrolled (18,421 undergraduates and 10,653 postgraduates) and 4,542 staff were employed (1,179 academic and 3,363 professional, administrative, support and service staff).

The UCT Employment Equity Plan April (2010 to 2015) indicated moderate but consistent changes in the demographic makeup of the staff body. The five-year plan specified specific targets ranging from between about 5% to 10% adjustments in the representation of SA black staff. According to the plan the staff makeup would have changed by 2015 by achieving either parity or more SA black staff than SA white in all categories other than senior lecturer and professor positions.

UCT spokesperson Elijah Moholola noted that, in 2017, UCT employed 45 white professors, 38 black African, Cape Coloured or Indian South African professors, 67 foreign national professors and 7 who did not disclose their race.

Student enrolment 2009–2013
Student enrolment by population group 2009–2013, showing percentage growth on base:

Student life
UCT had 36 different sports clubs in 2003, including team sports, individual sports, extreme sports and martial arts.

The university's sports teams, in particular the rugby union team, are known as the "Ikey Tigers" or the "Ikeys". The "Ikey" nickname originated in the 1910s as an antisemitic epithet applied to UCT students by the students of Stellenbosch University, because of the supposed large number of Jewish students at UCT. Stellenbosch is UCT's traditional rugby opponent; an annual "Intervarsity" match is played between the two universities. The University of Cape Town Football Club also known as the "Ikeys Warriors" is the main team for association football (soccer), representing the university at tournaments such as Varsity Football.

As of 2007 there were more than 80 student societies at UCT, falling into five categories:
 * Academic societies for those interested in a particular field of study or studying a particular topic: The most prominent of these include the History and Current Affairs Society (HCA), the Space and Astronomy Society (SpaceSoc, also a SEDS South Africa chapter), the United Nations Association of South Africa (UNASA), and the Students for Law and Social Justice (SLSJ).
 * Political societies, including branches of the youth wings of national political parties such as the South African Students Congress (SASCO), the Democratic Alliance Students Organisation (DASO), and the African National Congress Youth League.
 * Religious societies, some of which are associated with religious denominations or local places of worship.
 * National/cultural societies for students from particular countries or particular ethnic backgrounds.
 * Special interest societies (such as RainbowUCT, the university's LGBTI society, UCT Mountain & Ski Club, UCT Ballroom and Latin dancing) for those interested in various activities or issues.

In addition to the plethora of student societies, there are several student organisations dedicated to the development of communities surrounding the university in the Cape Metropolitan Area. Some of the biggest include: SHAWCO, Ubunye and RAG. Recently, several students movements have developed, such as the Green Campus Initiative.

Rankings
The university received a rank of 198 in the 2019 QS World University Rankings, a rank of 156 in the 2019 Times Higher Education World University Rankings, and a rank of 201–300 in the Shanghai Academic Ranking of World Universities.

The faculty of Commerce as well as the faculty of Law and Medicine have appeared in the top 100 faculties internationally. The law faculty achieved a global rank of 40 in the 2014 QS World University Rankings by Subject. Although the university remains the highest ranking in Africa as of 2022 its ranking has been declining since 2015.

QS World University Rankings Times Higher Education World University Rankings

Affiliations
UCT is a member of the Worldwide Universities Network (WUN), the Association of African Universities, the Association of Commonwealth Universities, the Cape Higher Education Consortium, Higher Education South Africa, the International Alliance of Research Universities (IARU), the African Research Universities Alliance (ARUA) and the International Association of Universities.

The Faculty of Law is a member of the Law Schools Global League (LSGL).

Notable alumni and staff
Five alumni of the University of Cape Town have been awarded Nobel Prizes: Ralph Bunche, American political scientist and diplomat awarded the Nobel Peace Prize in 1950 for his role in the 1949 Armistice Agreements, Professor Allan McLeod Cormack, physicist awarded the Nobel Prize in Medicine (1979) for his work on X-ray computed tomography, Max Theiler, virologist awarded the Nobel Prize in Physiology or Medicine in 1951 for developing a vaccine against yellow fever, Sir Aaron Klug, chemist and biophysicist awarded the Nobel Prize in Chemistry (1982) for his development of crystallographic electron microscopy and his structural elucidation of biologically important nucleic acid-protein complexes and Professor Emeritus J. M. Coetzee (Literature, 2003).

UCT alumni have gone on to achieve positions in academica, politics and other fields as follows. According to a non-peer reviewed study conducted by the Mail & Guardian in 2018, 6% of members of the Parliament of South Africa obtained a degree from UCT (the study had a sample of 247 out of 449 MPs). Ministers of the Cabinet of South Africa, Naledi Pandor and Ebrahim Patel, former Vice President of the World Bank and former Vice Chancellor of UCT, Mamphela Ramphele, South African surgeon Christiaan Barnard, South African writer Breyten Breytenbach, South African entrepreneur and inventor behind Ubuntu, Mark Shuttleworth, South African activist and judge Albie Sachs, former member of the South African music band Freshlyground, Zolani Mahola, South African cartoonist Zapiro and former Speaker of the National Assembly of South Africa, Baleka Mbete are among the alumni of the university. Kindly refer to List of Notable Alumni of the University of Cape Town for further information on notable UCT alumni.

The National Research Foundation of South Africa rates researchers and academics according to the quality of their research output in four categories. , 35 staff are A-rated, that being they are internationally recognised leaders in their fields. These are 30% of the A-rated researchers recognised by the NRF, making UCT, by far, the university with the highest number of such researchers. 6 researchers are recognised as P-rated, that being they have potential to become leaders in their fields. , 15% of South Africa's total NRF-rated researchers (about 524) are employed or associated with UCT. For a comprehensive and up-to-date list of B, Y and C-rated researchers, see this site.

, 19% of South African Research Chairs (about 42 academics) are held by UCT employed or associated researchers. 88 members of faculty are members of the Academy of Sciences of South Africa. Notable staff members include Minister of Trade and Industry, Ebrahim Patel, Minister of International Relations and Cooperation, Naledi Pandor, former Premier of the Western Cape, Helen Zille and George Ellis, collaborator with Stephen Hawking and winner of the 2004 Templeton Prize, was a professor of applied mathematics in the Faculty of Sciences. For a larger albeit inexhaustive list of former and current notable UCT faculty and staff, see the List of University of Cape Town faculty.

Notable research

 * The Department of Mathematics and Applied Mathematics is an international centre for research in the fields of cosmology and topology.
 * The Centre for Rhetoric Studies, the only one of its kind on the African Continent (director: Philippe-Joseph Salazar).
 * The Department of Physics is home to the UCT-CERN research centre, which is partially responsible for the software design of the High Level Trigger component of the ALICE experiment at the Large Hadron Collider, as well as other activities related to ALICE.
 * The Department of Electrical Engineering is involved in the development of technology for the Karoo Array Telescope (KAT). KAT is a precursor to the Square Kilometer Array, a proposed International project to build the world's largest radio telescope by 2020. Research groups in RF design and digital design contribute to the RF front-end and digital back-end of the KAT project.
 * The Institute of Infectious Disease and Molecular Medicine (IIDMM) is engaged in research on candidate tuberculosis vaccines, and is developing candidate HIV vaccines matched to the South African epidemic.
 * The OpenUCT Initiative is funded by the Andrew W. Mellon Foundation and works to make UCT's research, teaching and learning materials openly available online. Major research projects include the African Climate Development Initiative (ACDI) pilot curation project, Digital Scholarship in Emerging Knowledge Domains and Open Data in the Governance of South African Higher Education and Scholarly Communication in Africa (SCAP)
 * The Department of Archaeology has found some of the oldest evidence of art and abstract thought in the world. Specifically, engrained ostrich eggshell water containers dated to 60,000 years ago
 * The African Centre for Cities is one of the few research organisations focusing on urbanism in Africa.
 * On 21 September 2020 the new Khoi and San Centre was launched, with an undergraduate degree programme planned to be rolled out in coming years. The centre will support and consolidate this collaborative work on research commissions on language (including Khoekhoegowab), sacred human remains, land and gender.

The "Mafeje Affair"

University of Cape Town Council's decision to rescind Archie Mafeje's (black) offer for a senior lecturer position due to pressure from the Apartheid government angered students and led to protests on 15 August 1968 followed by a nine days sit-in at UCT administration building. Protesters faced intimidation from the government, anti-protestors and fellow Afrikaans students from other universities. The police swiftly squashed support for the sit-in. In the aftermath, Mafeje left the country and did not return until 2000.

Rhodes Must Fall
A debate at UCT over the removal of a statue of Cecil Rhodes spawned Rhodes Must Fall movement. The FeesMustFall movement, which began at Wits and spread to UCT, was inspired by the Rhodes Must Fall protests.

Destruction and censorship of art
Since the removal of the Rhodes statue, other art has been removed or destroyed. FeesMustFall students burned 23 of the university's historical paintings in February 2016.

According to GroundUp, art experts connected to the university are concerned about intolerance towards art at the institution, as UCT has removed and censored 75 further "vulnerable" art which it claims are offensive to students.

An Artworks Task Team was set up in September 2015 to assess art at the university "with a view to transformation and inclusivity", and went about finding "artworks on campus that may be seen to recognize or celebrate colonial oppressors and/or which may be offensive or controversial", and specifically artworks deemed to be "offensive" in their depiction of black people. Both Stanley Pinker's Decline and Fall, which makes ironic use of colonial iconology, and Breyten Breytenbach's Hovering Dog, which shows a black person wearing a white mask and a white person wearing a black mask, were removed; and Diane Victor's Pasiphaë, which depicts black farmers with allusions to Greek mythology, was covered by a wooden panel. In response, Breyten Breytenbach remarked that UCT were making fools of themselves, while Diane Victor thought UCT's actions were "slightly comical" and her artwork was being understood on a "simplistic level".

Jacques Rousseau, then chair of the Academic Freedom Committee, told GroundUp: "There are a number of artworks in UCT's collection that could legitimately be regarded as problematic. Even so, any piece of art is potentially offensive to someone, and the very point of art is to provoke reflection and sometimes discomfort." The Academic Freedom Committee noted with "grave concern recent instances of threats to academic freedom".

The South African Human Rights Commission was investigating the matter as of May 2017, in order to determine whether the university was infringing on the constitutional right to freedom of expression, in particular the right to artistic creativity.

Popular culture
The university was the shooting location of the 2019 film Critters Attack! where it was called Leroy College and the 2008 film Disgrace.

The university was the shooting location of Netflix movies The Kissing Booth and The Kissing Booth 2 and the 2020 Netflix series Blood & Water. The Upper Campus residence served as the grounds and building for the show's fictional Parkhurst College.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: University of Cape Town


text:
National Association of Theatre Owners

The National Association of Theatre Owners (NATO) is an American trade organization whose members are the owners of movie theaters. Most of the worldwide major theater chains' operators are members, as are hundreds of independent theater operators; collectively, they account for the operation of over 35,000 motion picture screens in all 50 U.S. states and over 33,000 screens in 100 other countries.

NATO was founded in 1965 by the merger of the largest movie theater trade organizations, the Theater Owners of America and the Allied States Association of Motion Picture Exhibitors.

The long-running official magazine of NATO is Boxoffice; between 2001 and 2007, they also published In Focus.

History
As the motion picture industry became larger, movie production companies began consolidating and controlling distribution. The largest producer, Famous Players–Lasky, joined and later merged with the largest distributor, Paramount (eventually becoming Paramount Pictures), and together they began block-booking in 1917, forcing theaters to buy mediocre films to get the good ones. Theaters banded together to bargain for better pricing, with 26 of the largest combining into First National Exhibitors Circuit—which went on to become a producer and distributor in its own right, before being bought by Warner Bros. By 1921, Paramount already owned 300 theaters, and other producers were catching up. Studios soon contracted with each other to keep first-runs inside the affiliated network, using this access to coerce independents into selling out.

In 1921, the first predecessor of NATO was founded, the largely affiliated Motion Picture Theater Owners of America (MPTOA), soon followed by the independent Allied States Association of Motion Picture Exhibitors (Allied), Unaffiliated Independent Motion Picture Exhibitors of America, National Independent Theatre Exhibitors, and more, to demand better pricing and access to first-runs. Unlike the others, the MPTOA embraced affiliated theaters, and soon became the largest organization.

During World War II, many theaters joined the new War Activities Committee, after the war becoming the Theatre Activities Committee and soon American Theatre Association (ATA), which strongly supported United States v. Paramount Pictures, Inc., the antitrust case against all of the major studios. A plan to merge with MPTOA, which strongly supported the studios, ran into friction, with many affiliated theaters leaving the ATA over its stance; conversely Allied, the largest purely-independent group, refused to join over the presence of affiliates. The merger went ahead in 1947, minus affiliates of Loews, RKO, and Warner Bros., and they became the Theater Owners of America (TOA) with about 10,000 theaters.

After divestiture in the fallout of the 1948 Paramount decision, many formerly-affiliated theaters ended up joining either TOA or Allied. During the post-war period, theater revenue collapsed as television became widespread, even as film rental became more expensive, and thousands of theaters closed, particularly in city centers hard hit by suburban flight. Finally, in 1966 TOA and Allied merged into the National Association of Theatre Owners, largely based on TOA's structure but headed by Marshall Fine, former Allied chairman.

The 1970s were difficult for NATO; although the blockbuster The Godfather revitalized theater-going and revenue, in 1975 a new National Independent Theatre Exhibitors (NITE) came together to challenge NATO, eventually numbering almost a thousand theaters, and governance reforms were pushed by members as well. When the reforms stalled, the entire California and Illinois chapters pulled out in 1977, along with many small chains around the nation. After 1980, many of the requested reforms were finally implemented, including a full-time president and a full-time lobbyist in Washington, as well as moving its headquarters from New York to Los Angeles; by the end of the decade, NITE had folded back into NATO, leaving only one dominant organization.

The 1980s saw a relaxation of antitrust regulation and subsequent purchasing of many chains by distributors and large conglomerates, including 120 theaters by Paramount and Warner; by the end of the decade, consolidation left the top 10 owners in control of 55 percent of the industry. In the 1990s, theater growth exploded, and by 1999, movie screens peaked at 36,448, the vast majority of which were affiliated with NATO.

CinemaCon
As ShoWest, the convention was formerly one of four major worldwide annual events owned by the Film Group unit of Nielsen Business Media before being sold in 2011 to e5 Global Media and operated exclusively by NATO.

Renamed CinemaCon in 2011, the convention is NATO's only official convention of theater owners controlled by the organization itself. The first gathering took place in March 2011 at Caesars Palace in Las Vegas, Nevada, with the second held April 23–26, 2012, at the same venue.

CinemaCon is now a stand-alone movie theater industry trade show or exposition originally established by NATO in 1975, usually held in Las Vegas in March.

On March 11, 2020, NATO canceled CinemaCon 2020 due to the COVID-19 pandemic.

ShoWest Convention 1976

 * George Barrie – Producer of the Year Award

ShoWest Convention 1978

 * George Lucas – Director of the Year Award
 * Mark Hamill – Male Star of Tomorrow Award
 * Henry Winkler – Male Star of the Year Award
 * Robert Mitchum – Lifetime Achievement Award

ShoWest Convention 1979

 * Jane Fonda – Female Star of the Year Award
 * Jon Voight –Male Star of the Year Award
 * Sylvester Stallone – Star of the Year Award
 * Michael Douglas – Star/Producer of the Year Award

ShoWest Convention 1981

 * George Hamilton – Showman of the Year Award

ShoWest Convention 1982

 * Steven Spielberg – Director of the Year Award
 * Frank Marshall – Producer of the Year Award
 * Pia Zadora – Young Star of the Year Award
 * Chuck Norris – Action Star of the Year Award
 * Rich Little – Entertainer of the Year Award
 * Clint Eastwood – Male Star of the Decade Award
 * Lori Singer – Newcomer of the Year Award
 * Sean Connery – Worldwide Star of the Year Award

ShoWest Convention 1983

 * Taylor Hackford – Director of the Year Award
 * Shelley Long – Female Star of Tomorrow Award
 * Debra Winger – Female Star of the Year Award
 * David Keith – Male Star of Tomorrow Award
 * Richard Gere – Male Star of the Year Award
 * Sydney Pollack – Producer of the Year Award
 * Louis Gossett, Jr. – Best Supporting Actor Award

ShoWest Convention 1984

 * Lori Singer – Breakthrough Performer of the Year Award
 * Sylvester Stallone – Star of Stars Award
 * Charlton Heston – Lifetime Achievement Award

ShoWest Convention 1985

 * Kelly LeBrock – Female Star of Tomorrow Award
 * Eric Stoltz – Male Star of Tomorrow Award
 * Arnold Schwarzenegger – International Star of the Year Award
 * Eddie Murphy – Star of the Year Award

ShoWest Convention 1986

 * Roy Scheider – Career Achievement Award

ShoWest Convention 1987

 * Leonard Nimoy – Director of the Year Award
 * Paul Hogan – Male Star of the Year Award
 * Tom Cruise – Box Office Star of the Year Award

ShoWest Convention 1988

 * Bette Midler – Female Star of the Year Award
 * Don Johnson – Male Star of the Year Award

ShoWest Convention 1989

 * James L. Brooks – Director of the Year Award
 * Carey Lowell & Talisa Soto – Female Star of Tomorrow Award
 * Glenn Close – Female Star of the Year Award
 * Danny DeVito – Male Star of the Year Award
 * David Zucker, Jerry Zucker, Robert K. Weiss & Jim Abrahams – Comedy Filmmakers of the Year Award
 * Leslie Nielsen – Male Comedy Star of the Year Award

ShoWest Convention 1990

 * Tim Burton – Director of the Year Award
 * Winona Ryder – Female Star of Tomorrow Award
 * Anjelica Huston – Female Star of the Year Award
 * Johnny Depp – Male Star of Tomorrow Award
 * Jeff Bridges – Male Star of the Year Award
 * Joel Silver – Producer of the Year Award

ShoWest Convention 1991

 * Jerry Zucker – Director of the Year Award
 * Robin Givens – Female Star of Tomorrow Award
 * Julia Roberts – Female Star of the Year Award
 * Richard Grieco – Male Star of Tomorrow Award
 * Andy Garcia – Male Star of the Year Award
 * John Hughes – Producer of the Year Award

ShoWest Convention 1992

 * Lawrence Kasdan – Director of the Year Award
 * Jodie Foster – Female Star of the Year Award
 * Nicole Kidman – Female Star of Tomorrow Award
 * Stephen Dorff – Male Star of Tomorrow Award
 * Patrick Swayze – Male Star of the Year Award
 * Brian Grazer – Producer of the Year Award
 * John Singleton – Screenwriter of the Year Award
 * John Singleton – Directorial Debut of the Year Award
 * Chuck Norris – International Box Office Star of the Year Award
 * Oliver Stone – Meritorious Achievement Award
 * Cuba Gooding, Jr. – Newcomer of the Year Award
 * Eddie Murphy – Star of the Decade Award

ShoWest Convention 1993

 * Clint Eastwood – Director of the Year Award
 * Juliette Lewis – Female Star of Tomorrow Award
 * Whoopi Goldberg – Female Star of the Year Award
 * Brad Pitt – Male Star of Tomorrow Award
 * Mel Gibson – Male Star of the Year Award
 * Mace Neufeld & Robert Rehme – Producer of the Year Award
 * Richard Friedenberg – Screenwriter of the Year Award
 * Arnold Schwarzenegger – International Star of the Decade Award
 * George Kennedy – Special Award of Merit
 * Jack Lemmon & Walter Matthau – Lifetime Achievement Award

ShoWest Convention 1994

 * Steven Spielberg – Director of the Year Award
 * Tia Carrere – Female Star of Tomorrow Award
 * Michelle Pfeiffer – Female Star of the Year Award
 * Chris O'Donnell – Male Star of Tomorrow Award
 * Robin Williams – Male Star of the Year Award
 * Arnold Kopelson – Producer of the Year Award
 * Steven Zaillian – Screenwriter of the Year Award
 * Elijah Wood – Young Star of the Year Award
 * Harrison Ford – Box Office Star of the Century Award
 * Kirk Douglas – Lifetime Achievement Award

ShoWest Convention 1995

 * Robert Zemeckis – Director of the Year Award
 * Julia Ormond – Female Star of Tomorrow Award
 * Demi Moore – Female Star of the Year Award
 * Martin Lawrence & Will Smith – Male Star of Tomorrow Award
 * Tom Hanks – Male Star of the Year Award
 * James Cameron – Producer of the Year Award
 * Paul Attanasio – Screenwriter of the Year Award
 * Mara Wilson – Young Star of the Year Award
 * Jim Carrey – Comedy Star of the Year Award
 * Christina Ricci – Star of the Year Award
 * Faye Dunaway – Lifetime Achievement Award

ShoWest Convention 1996

 * Mel Gibson – Director of the Year Award
 * Cameron Diaz – Female Star of Tomorrow Award
 * Sandra Bullock – Female Star of the Year Award
 * Greg Kinnear – Male Star of Tomorrow Award
 * John Travolta – Male Star of the Year Award
 * James G. Robinson – Producer of the Year Award
 * Edward Burns – Screenwriter of the Year Award
 * Jonathan Taylor Thomas – Young Star of the Year Award
 * John Lasseter – Outstanding Achievement Award
 * Sophia Loren – Lifetime Achievement Award

ShoWest Convention 1997

 * Joel Schumacher – Director of the Year Award
 * Claire Danes – Female Star of Tomorrow Award
 * Winona Ryder – Female Star of the Year Award
 * Howie Long – Male Star of Tomorrow Award
 * Denzel Washington – Male Star of the Year Award
 * Arnon Milchan – Producer of the Year Award
 * Albert Brooks & Monica Mcgowan Johnson – Screenwriter of the Year Award
 * Alex D. Linz – Young Star of the Year Award
 * The Rock – Favorite Movie of the Year Award
 * Will Smith – International Box Office Achievement Award
 * Cuba Gooding, Jr. – Supporting Actor of the Year Award
 * Elizabeth Hurley – Supporting Actress of the Year Award
 * Arnold Schwarzenegger – Humanitarian Award

ShoWest Convention 1998

 * Anthony Hopkins – Actor of the Year Award
 * Helen Hunt – Actress of the Year Award
 * Barry Levinson – Director of the Year Award
 * Minnie Driver – Female Star of Tomorrow Award
 * Matt Damon – Male Star of Tomorrow Award
 * Laurie MacDonald & Walter F. Parkes – Producer of the Year Award
 * Ronald Bass – Screenwriter of the Year Award
 * Burt Reynolds – Supporting Actor of the Year Award
 * Joan Allen – Supporting Actress of the Year Award
 * Jerry Bruckheimer – International Box Office Achievement Award
 * Julia Roberts – International Star of the Year Award
 * Susan Sarandon – Humanitarian Award

ShoWest Convention 1999

 * Will Smith – Actor of the Year Award
 * Meg Ryan – Actress of the Year Award
 * John Madden – Director of the Year Award
 * Heather Graham – Female Star of Tomorrow Award
 * Giovanni Ribisi – Male Star of Tomorrow Award
 * Jerry Bruckheimer – Producer of the Year Award
 * Bobby Farrelly & Peter Farrelly – Screenwriter of the Year Award
 * William H. Macy – Supporting Actor of the Year Award
 * Catherine Zeta-Jones – Supporting Actress of the Year Award
 * Tom Hanks – Box Office Star of the Decade Award
 * Adam Sandler – Comedy Star of the Year Award
 * Sean Connery – Lifetime Achievement Award

ShoWest Convention 2000

 * Anthony Minghella – Director of the Year Award
 * Hilary Swank – Female Star of Tomorrow Award
 * Annette Bening – Female Star of the Year Award
 * John Williams – Maestro of the Year Award
 * Michael Clarke Duncan – Male Star of Tomorrow Award
 * Jim Carrey – Male Star of the Year Award
 * Armyan Bernstein – Producer of the Year Award
 * Alan Ball – Screenwriter of the Year Award
 * Ving Rhames – Supporting Actor of the Year Award
 * Angelina Jolie – Supporting Actress of the Year Award
 * Drew Barrymore – Comedy Star of the Year Award

ShoWest Convention 2001

 * Wolfgang Petersen – Director of the Year Award
 * Sandra Bullock – Female Star of the Year Award
 * Ang Lee – International Filmmaker of the Year Award
 * Michelle Yeoh – International Star of the Year Award
 * Heath Ledger – Male Star of Tomorrow Award
 * Russell Crowe – Male Star of the Year Award
 * Richard D. Zanuck & David Brown – Producer of the Year Award
 * William Broyles, Jr. – Screenwriter of the Year Award
 * Haley Joel Osment – Supporting Actor of the Year Award
 * Judi Dench – Supporting Actress of the Year Award
 * Chris Rock – Comedy Star of the Year Award
 * Nicolas Cage – Distinguished Decade of Achievement in Film Award

ShoWest Convention 2002

 * Ron Howard – Director of the Year Award
 * Naomi Watts – Female Star of Tomorrow Award
 * Jennifer Lopez – Female Star of the Year Award
 * Jean-Pierre Jeunet – International Filmmaker of the Year Award
 * Josh Hartnett – Male Star of Tomorrow Award
 * Will Smith – Male Star of the Year Award
 * Douglas Wick – Producer of the Year Award
 * Julian Fellowes – Screenwriter of the Year Award
 * Marisa Tomei – Supporting Actress of the Year Award
 * Chris Tucker – Comedy Star of the Year Award
 * Nicole Kidman – Distinguished Decade of Achievement in Film Award
 * Steven Spielberg – Lifetime Achievement Award

ShoWest Convention 2003

 * Sam Mendes – Director of the Year Award
 * Alison Lohman – Female Star of Tomorrow Award
 * Diane Lane – Female Star of the Year Award
 * Fernando Meirelles – International Achievement in Filmmaking Award
 * LL Cool J – Male Star of Tomorrow Award
 * Adam Sandler – Male Star of the Year Award
 * David Heyman – Producer of the Year Award
 * Antwone Fisher – Screenwriter of the Year Award
 * Christopher Walken – Supporting Actor of the Year Award
 * Catherine Zeta-Jones – Supporting Actress of the Year Award
 * Chris Wedge – Animation Director of the Year Award
 * Brian Grazer – Lifetime Achievement Award

ShoWest Convention 2004

 * Jennifer Garner – Female Star of Tomorrow Award
 * Halle Berry – Female Star of the Year Award
 * Niki Caro – International Filmmaker of the Year Award
 * Ryan Gosling – Male Star of Tomorrow Award
 * Jude Law – Male Star of the Year Award
 * John Davis – Producer of the Year Award
 * Djimon Hounsou – Supporting Actor of the Year Award
 * Andrew Stanton – Animation Director of the Year Award
 * Jack Black – Comedy Star of the Year Award
 * Drew Barrymore & Gwyneth Paltrow – Distinguished Decade of Achievement in Film Award
 * Lawrence Gordon – Lifetime Achievement Award

ShoWest Convention 2005

 * Rob Cohen – Director of the Year Award
 * Jessica Biel – Female Star of Tomorrow Award
 * Jennifer Aniston – Female Star of the Year Award
 * Danny Boyle – International Filmmaker of the Year Award
 * Hayden Christensen – Male Star of Tomorrow Award
 * Matt Damon – Male Star of the Year Award
 * Rachel McAdams – Supporting Actress of the Year Award
 * Catalina Sandino Moreno – International Star of the Year Award
 * George Lucas – Galactic Achievement Award

ShoWest Convention 2006

 * M. Night Shyamalan – Director of the Year Award
 * Jennifer Hudson – Female Star of Tomorrow Award
 * Natalie Portman – Female Star of the Year Award
 * Guillermo del Toro – International Achievement in Filmmaking Award
 * Brandon Routh – Male Star of Tomorrow Award
 * Hugh Jackman – Male Star of the Year Award
 * Dakota Fanning – Supporting Actress of the Year Award
 * Vince Vaughn – Comedy Star of the Year Award
 * Laurence Fishburne – Distinguished Decade of Achievement in Film Award
 * John Lasseter – Pioneer of Animation Award
 * Keke Palmer – Rising Star of the Year Award

ShoWest Convention 2007

 * Christopher Miller & Raman Hui – Animation Director of the Year Award
 * Dane Cook – Breakout Performance of the Year Award
 * Quentin Tarantino & Robert Rodriguez – Director of the Year Award
 * Mark Burg & Oren Koules – Excellence in Producing Award
 * Emma Roberts – Female Star of Tomorrow Award
 * Kirsten Dunst – Female Star of the Year Award
 * Alfonso Cuaron – International Achievement in Filmmaking Award
 * Shia LaBeouf – Male Star of Tomorrow Award
 * Don Cheadle – Male Star of the Year Award
 * Jerry Weintraub – Producer of the Year Award
 * Bruce Joel Rubin – Screenwriter of the Year Award
 * Freddy Rodriguez – Supporting Actor of the Year Award
 * Rosario Dawson – Supporting Actress of the Year Award
 * Steve Carell – Comedy Star of the Year Award

ShoWest Convention 2008

 * Helen Hunt – Breakthrough Director of the Year Award
 * Marvin Levy – Career Achievement in Film Making Award
 * Christopher Nolan – Director of the Year Award
 * Brendan Fraser – Distinguished Decade of Achievement in Film Award
 * David Mamet – Excellence in Filmmaking Award
 * Abigail Breslin – Female Star of Tomorrow Award
 * Anne Hathaway – Female Star of the Year Award
 * Alan Ball – Groundbreaking Filmmaker of the Year Award
 * Sergei Bodrov – International Achievement in Filmmaking Award
 * Emile Hirsch – Male Star of Tomorrow Award
 * Robert Downey, Jr. – Male Star of the Year Award
 * Charles Roven – Producer of the Year Award
 * Jim Sturgess, Kevin Spacey, Kate Bosworth, Laurence Fishburne, Aaron Yoo, Liza Lapira, Jacob Pitts & Josh Gad – Best Ensemble Award
 * Seth Rogen – Comedy Star of the Year Award
 * Sarah Jessica Parker – ShoWest Vanguard Award
 * Ang Lee & James Schamus – ShoWest/NATO Freedom of Expression Award
 * Robert Redford – Visionary Award

ShoWest Convention 2009

 * Zac Efron – Breakthrough Performer of the Year Award
 * Zack Snyder – Director of the Year Award
 * Briana Evigan, Leah Pipes, Rumer Willis, Jamie Chung, Audrina Patridge & Margo Harshman – Female Star of Tomorrow Award
 * Rachel McAdams – Female Star of the Year Award
 * Chris Pine – Male Star of Tomorrow Award
 * Dennis Quaid – Male Star of the Year Award
 * Sienna Miller – Supporting Actor of the Year Award
 * Patricia Clarkson – Independent Award for Excellence in Acting
 * Kathryn Bigelow – Triumph Award for Outstanding Direction
 * Roger Ebert – Career Achievement in Film Journalism
 * Bradley Cooper – Comedy Star of the Year Award
 * Michael Bay – ShoWest Vanguard Award for Excellence in Filmmaking
 * Mark Christiansen – Ken Mason InterSociety Award
 * Michael Caine – Lifetime Achievement Award

ShoWest Convention 2010

 * Amanda Seyfried – Breakthrough Female Star of the Year Award
 * Todd Phillips – Director of the Year Award
 * Sarah Jessica Parker, Kim Cattrall, Kristin Davis & Cynthia Nixon – Ensemble Award
 * Vanessa Anne Hudgens – Female Star of Tomorrow Award
 * Katherine Heigl – Female Star of the Year Award
 * Alex Pettyfer – Male Star of Tomorrow Award
 * Sam Worthington – Male Star of the Year Award
 * Jay Roach – Comedy Director of the Decade Award
 * Zach Galifianakis – Comedy Star of the Year Award
 * Jerry Bruckheimer – Lifetime Achievement Award

ShoWest Convention 2011

 * Chloe Bridges & Sasha Pieterse – Breakthrough Performer of the Year Award

ShoWest Convention 2014

 * Cameron Deane Stewart, Justin Deeley, Meaghan Martin, Allie Gonino, Ally Maki, Nikki Blonsky, Alex Newell, Scott Bakula, Marin Hinkle & Ana Gasteyer – Ensemble Award

Other conventions
The remaining Nielsen Media event properties include CineEurope held in Barcelona, Spain in June, CineAsia held in early December in varying locations throughout Southeast Asia, and ShowEast, held in late October or early November in the Southeastern United States, usually somewhere in the Miami-Dade area.

American Movie Awards
In 1980, NATO initiated the American Movie Awards, held at the Wilshire Theater, Beverly Hills, California, and broadcast on NBC, with the winners selected based on voting by theater patrons. Various legal difficulties prevented the awards from being presented in 1981, and the event was discontinued after the 1982 awards due to competition from other awards shows.

====CinemaCon Awards 2011 ====
 * Cameron Diaz – Female Star of the Year Award
 * Vin Diesel – Action Star of the Year Award
 * Rosie Huntington-Whiteley – Female Star of Tomorrow Award
 * Chris Hemsworth – Male Star of Tomorrow Award
 * Blake Lively – Breakthrough Performer of the Year Award
 * Ryan Reynolds – Male Star of the Year Award
 * Harry Potter Film Franchise – Hall of Fame Award
 * Helen Mirren – Career Achievement Award
 * Russell Brand – Comedy Star of the Year Award
 * Morgan Spurlock – Documentary Filmmaker of the Year Award
 * Tyler Perry – Visionary Award
 * Jason Momoa – Rising Star of 2011 Award (male)
 * Julianne Hough – Rising Star of 2011 Award (female)
 * Sid Ganis – Inter-Society's 2011 Ken Mason Award
 * Miky Lee – Global Achievement in Exhibition Award
 * Richard Fox – CinemaCon Passepartout Award
 * Dick Cook – Pioneer of the Year

CinemaCon Awards 2012

 * Jennifer Garner – Female Star of the Year Award
 * Jeremy Renner – Male Star of the Year Award
 * Dwayne Johnson – Action Star of the Year Award
 * Anna Faris – Comedy Star of the Year Award
 * Chloë Grace Moretz – Female Star of Tomorrow Award
 * Taylor Kitsch – Male Star of Tomorrow Award
 * Josh Hutcherson – Breakthrough Performer of the Year Award
 * Charlize Theron – Distinguished Decade of Achievement in Film Award
 * Michelle Pfeiffer – Cinema Icon Award
 * Sylvester Stallone – Career Achievement Award
 * Judd Apatow – Award of Excellence in Filmmaking
 * Timur Bekmambetov – International Filmmaker of the Year Award
 * Universal Pictures International's Jack Ledwith – Passepartout Award
 * Ted Pedas – NATO Marquee Award
 * Delfin Fernandez – International Achievement in Exhibition Award
 * Jeffrey Katzenberg – Pioneer of the Year

National Cinema Day
Cinema Foundation, the nonprofit arm of NATO, announced National Cinema Day for September 3, 2022, in which over 3,000 theaters would offer showings for US$3. National Cinema Day occurred again on August 27, 2023, in which 3,000 theaters offered showings for US$4. A similar event was held in the United Kingdom on 3rd September 2023, in which all cinema tickets were £3.

Average U.S. movie ticket price
NATO provides an annual average movie ticket price, in April, each year. In 2019, at $9.16, this stopped, due to Covid closures. In 2022, box office receipts were 66 percent of 2019, yet attendance levels were 55 percent of 2019. In 2022, IndieWire concluded that average movie ticket prices rose, at least 20 percent, to $11, based on the 2022 second-quarter AMC Theatres earnings call which stated a 22 percent ticket revenue rise compared to the 2019 second-quarter.

title: National Association of Theatre Owners


text:
Tayster and Rojac Records

Tay-ster and Rojac Records was a record label originally founded by purported gangster Fat Jack Taylor as Rojac Records in 1957 as a soul and R&B label, releasing, among other artists, a number of records by Big Maybelle. Rojac Records ceased operations in 1972 but was briefly revived as Tay-ster and Rojac Records, operating out of offices located above the Harlem World Disco nightclub from 1979 until 1984. During this latter phase the label released Disco and early Hip Hop records, among them Lovebug Starski's first single produced by David MacDonald nicknamed "Mighty Whitey". Other artists on the label included Harlem World Crew and Lady Smiley.

title: Tayster and Rojac Records