The following pages link to (Q5724802):
Displayed 31 items.
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs (Q685676) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Cycles in graphs and functional inequalities (Q753833) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- On the number of certain subgraphs contained in graphs with a given number of edges (Q1073050) (← links)
- The maximal number of induced complete bipartite graphs (Q1088676) (← links)
- The number of triangles in a \(K_ 4\)-free graph (Q1112062) (← links)
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey (Q1136781) (← links)
- On the number of subgraphs of prescribed type of graphs with a given number of edges (Q1158165) (← links)
- Extremals of functions on graphs with applications to graphs and hypergraphs (Q1158166) (← links)
- On the number of complete subgraphs contained in certain graphs (Q1159691) (← links)
- On finite Ramsey numbers (Q1173103) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- The chromatic uniqueness of complete bipartite graphs (Q1182979) (← links)
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs (Q1205339) (← links)
- Two path extremal graphs and an application to a Ramsey-type problem (Q1297399) (← links)
- The maximum number of triangles in a \(K_4\)-free graph (Q1297475) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681) (← links)
- Graph products and monochromatic multiplicities (Q1382400) (← links)
- The number of complete subgraphs of equi-partite graphs (Q1584280) (← links)
- The maximal number of induced \(r\)-partite subgraphs (Q1805369) (← links)
- A new Turán-type theorem for cliques in graphs (Q1827735) (← links)
- Large generalized books are \(p\)-good (Q1880791) (← links)
- Multiplicities of subgraphs (Q1912755) (← links)
- Bounds on graph eigenvalues. II (Q2459961) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- Some corollaries of a theorem of Whitney on the chromatic polynomial (Q2640610) (← links)
- Generalized Ramsey theory for graphs (Q5642585) (← links)
- A new generalization of the Erdős-Ko-Rado theorem (Q5896187) (← links)