The following pages link to (Q5781249):
Displaying 50 items.
- The intersection numbers of a complex (Q1228618) (← links)
- Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- An upper bound for the Turán number \(t_3(n,4)\) (Q1304632) (← links)
- Turán's theorem and maximal degrees (Q1306430) (← links)
- Extremal problems and generalized degrees (Q1322223) (← links)
- Largest size and union of Helly families (Q1322238) (← links)
- On unique independent sets in graphs (Q1331985) (← links)
- The decision-tree complexity of element distinctness (Q1342263) (← links)
- The size of graphs with clique number \(m\) and without nowhere-zero 4-flows (Q1356551) (← links)
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (Q1356730) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Embedding partial extended triple systems and totally symmetric quasigroups (Q1377692) (← links)
- The extremal graph problem of the icosahedron (Q1394239) (← links)
- On a geometric combinatorial problem (Q1584210) (← links)
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) (Q1617001) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
- The ferry cover problem on regular graphs and small-degree graphs (Q1624206) (← links)
- Gaps in the saturation spectrum of trees (Q1630934) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- On ordered Ramsey numbers of bounded-degree graphs (Q1633749) (← links)
- Turán function and \(H\)-decomposition problem for gem graphs (Q1649911) (← links)
- Retracted: A remark on the weak Turán's theorem (Q1650389) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- The minimum number of triangles in graphs of given order and size (Q1690017) (← links)
- Turán numbers for odd wheels (Q1699569) (← links)
- Degree powers in graphs with a forbidden forest (Q1712530) (← links)
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number (Q1717211) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- The Turán number for spanning linear forests (Q1720343) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- On the Turán density of \(\{1, 3\}\)-hypergraphs (Q1732027) (← links)
- Spectral extremal results with forbidding linear forests (Q1733881) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- Dense 3-uniform hypergraphs containing a large clique (Q1741994) (← links)
- Bipartite algebraic graphs without quadrilaterals (Q1744742) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Extremal numbers for directed hypergraphs with two edges (Q1753023) (← links)
- On the existence of Frobenius digraphical representations (Q1753102) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- Embeddings of partial Steiner triple systems (Q1826857) (← links)
- The number of graphs without forbidden subgraphs (Q1826950) (← links)
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem (Q1850610) (← links)
- Testing metric properties (Q1877548) (← links)
- Greedy clique decompositions and the Turán numbers (Q1896337) (← links)
