The following pages link to On the theory of graphs (Q5826301):
Displaying 50 items.
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- On the Turán number of forests (Q396789) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Independence numbers of graphs and generators of ideals (Q585219) (← links)
- On unavoidable graphs (Q595677) (← links)
- Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four (Q663476) (← links)
- On critical subgraphs of colour-critical graphs (Q759160) (← links)
- The combinatorial structure of (\(m,n\))-convex sets (Q759397) (← links)
- On an extremal problem in graph theory. (Q775325) (← links)
- Spectral extrema of graphs: forbidden hexagon (Q785828) (← links)
- On disjointly representable sets (Q790112) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Extremal graphs for blow-ups of stars and paths (Q827605) (← links)
- Size of weakly saturated graphs (Q878645) (← links)
- Parallel selection (Q913517) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- Bivalent trees and forests or upper bounds for the probability of a union revisited (Q1051331) (← links)
- The maximum number of cliques in dense graphs (Q1061136) (← links)
- Intersection properties of boxes. I: An upper-bound theorem (Q1107826) (← links)
- The number of triangles in a \(K_ 4\)-free graph (Q1112062) (← links)
- The maximal size of the covering graph of a lattice (Q1134774) (← links)
- On an extremal problem concerning the theory of graphs (Q1145157) (← links)
- Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I (Q1153930) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- On the lotto problem (Q1170263) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- Intersection properties of boxes. II: Extremal families (Q1182651) (← links)
- Bounds on the number of complete subgraphs (Q1195482) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Three-graphs without two triples whose symmetric difference is contained in a third (Q1211060) (← links)
- Single subject incomplete designs for nonmetric multidimensional scaling (Q1213410) (← links)
- The maximum number of q-cliques in a graph with no p-clique (Q1222664) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- On Turan hypergraphs (Q1245242) (← links)
- A Turan type problem for interval graphs (Q1251233) (← links)
- Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques (Q1251234) (← links)
- Le nombre minimal de colorations d'un hypergraphe k-chromatique (Q1255502) (← links)
- On the density of subgraphs in a graph with bounded independence number (Q1272486) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- The maximum clique problem (Q1318271) (← links)
- Chromaticity of the complements of paths and cycles (Q1356659) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- 0-1 matrices with zero trace whose squares are 0-1 matrices (Q1736213) (← links)
- Extremal numbers for directed hypergraphs with two edges (Q1753023) (← links)
- Generating hard and diverse test sets for NP-hard graph problems (Q1805463) (← links)
