The following pages link to (Q5724802):
Displaying 50 items.
- Ramsey numbers of a fixed odd-cycle and generalized books and fans (Q294540) (← links)
- Combinatorial theorems in sparse random sets (Q350550) (← links)
- On the Ramsey multiplicity of complete graphs (Q452823) (← links)
- On the number of \(K_4\)-saturating edges (Q462935) (← links)
- Monochromatic triangles in three-coloured graphs (Q463289) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- A note on the inducibility of 4-vertex graphs (Q497330) (← links)
- Independent sets in graphs (Q501998) (← links)
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems (Q518192) (← links)
- Generating all subsets of a finite set with disjoint unions (Q640845) (← links)
- 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)
- On the discrepancy between two Zagreb indices (Q724879) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← 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)
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko (Q1621060) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
- Star-critical Ramsey numbers for large generalized fans and books (Q1800410) (← 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)
- On the distance of databases (Q1928825) (← links)
- Counting substructures. I: Color critical graphs (Q1959675) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
