The following pages link to (Q5781249):
Displaying 50 items.
- Beyond graph energy: norms of graphs and matrices (Q739093) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane (Q745667) (← links)
- A spectral approach to polyhedral dimension (Q750306) (← links)
- On an extremal problem in graph theory. (Q775325) (← links)
- On the independence number of non-uniform uncrowded hypergraphs (Q776287) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- On Helly families of maximal size (Q793730) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- Extremal graphs for blow-ups of stars and paths (Q827605) (← links)
- Longest cycles in almost regular 3-partite tournaments (Q860458) (← links)
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- Rainbow numbers for graphs containing small cycles (Q897256) (← links)
- Complete \(r\)-partite graphs determined by their domination polynomial (Q897257) (← links)
- Saturation numbers for linear forests \(P_5\cup tP_2\) (Q897277) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Ore-condition and \(Z_3\)-connectivity (Q942129) (← links)
- On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs (Q947730) (← links)
- An application of the Turán theorem to domination in graphs (Q948691) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- A note on an embedding problem in transitive tournaments (Q965937) (← links)
- On finite simple groups and Kneser graphs. (Q968241) (← links)
- The early evolution of the \(H\)-free process (Q982189) (← links)
- Pairwise generating and covering sporadic simple groups. (Q984990) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) (Q1025958) (← links)
- Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
- On non-strong jumping numbers and density structures of hypergraphs (Q1043558) (← links)
- Maximum induced trees in graphs (Q1082351) (← links)
- Another extremal problem for Turan graphs (Q1093651) (← links)
- Intersection properties of boxes. I: An upper-bound theorem (Q1107826) (← links)
- Embedding partial triple systems (Q1112041) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- Large dense neighbourhoods and Turán's theorem (Q1171071) (← links)
- Triangle-free partial graphs and edge covering theorems (Q1171575) (← links)
- Lower bounds on the stability number of graphs computed in terms of degrees (Q1175993) (← links)
- Edges in graphs with large girth (Q1180673) (← links)
- Intersection properties of boxes. II: Extremal families (Q1182651) (← links)
- Saturated \(r\)-uniform hypergraphs (Q1184855) (← links)
- Three-graphs without two triples whose symmetric difference is contained in a third (Q1211060) (← links)
- Développements recents de la théorie des graphes (Q1226996) (← links)
