Pages that link to "Item:Q1164626"
From MaRDI portal
The following pages link to On the combinatorial problems which I would most like to see solved (Q1164626):
Displaying 50 items.
- On some three-color Ramsey numbers for paths (Q266822) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Two extensions of Ramsey's theorem (Q394821) (← links)
- Turán problems on non-uniform hypergraphs (Q470944) (← links)
- A bichromatic incidence bound and an application (Q650111) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm (Q740905) (← links)
- On the number of homogeneous subgraphs of a graph (Q759767) (← links)
- Three-regular parts of four-regular graphs (Q762503) (← links)
- On finite set-systems whose every intersection is a kernel of a star (Q787982) (← links)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry (Q789732) (← links)
- The Ramsey number for a triple of long even cycles (Q885294) (← links)
- A note on the probabilistic approach to Turan's problem (Q1054749) (← links)
- Cycles in graphs of uncountable chromatic number (Q1056761) (← links)
- On color critical graphs (Q1059085) (← links)
- Forbidding just one intersection (Q1062676) (← links)
- Regular subgraphs of dense graphs (Q1078194) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← links)
- Consistency results on infinite graphs (Q1117946) (← links)
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs (Q1123216) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
- On a problem of Erdős and Lovász: Random lines in a projective plane (Q1204526) (← links)
- On the number of circles determined by \(n\) points in the Euclidean plane (Q1320453) (← links)
- Unbalanced Steiner triple systems (Q1323826) (← links)
- A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- On a geometric combinatorial problem (Q1584210) (← links)
- Note on the multicolour size-Ramsey number for paths (Q1671658) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- Size-Ramsey numbers of cycles versus a path (Q1752689) (← links)
- The Ramsey numbers for a triple of long cycles (Q1786049) (← links)
- Maximal intersecting families and affine regular polygons in \(PG(2,q)\) (Q1812686) (← links)
- Regular subpseudographs of regular pseudographs (Q1813087) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Clique covers and coloring problems of graphs (Q1823258) (← links)
- Covers in hypergraphs (Q1838499) (← links)
- Nearly bipartite graphs with large chromatic number (Q1839258) (← links)
- A threshold for perfect matchings in random d-pure hypergraphs (Q1839262) (← links)
- On homogeneous sets of positive integers (Q1873829) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- On the rational Turán exponents conjecture (Q1998761) (← links)
- Note on sunflowers (Q2032700) (← links)
- The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
- On line colorings of finite projective spaces (Q2045382) (← links)
