The following pages link to (Q4878666):
Displayed 50 items.
- Cycles of given length in oriented graphs (Q965252) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- On the Ramsey number of sparse 3-graphs (Q1015430) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- The 3-colored Ramsey number of even cycles (Q1026011) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- Highly connected coloured subgraphs via the regularity Lemma (Q1045023) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- A Tverberg-type result on multicolored simplices (Q1388134) (← links)
- On a tiling conjecture of Komlós for 3-chromatic graphs. (Q1426117) (← links)
- Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← links)
- Proof of an entropy conjecture of Leighton and Moitra (Q1621423) (← links)
- Lower bounds for the smallest singular value of structured random matrices (Q1621447) (← links)
- On the complexity of finite subgraphs of the curve graph (Q1626407) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Distributing pairs of vertices on Hamiltonian cycles (Q1650670) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
- Bipartite Ramsey numbers for graphs of small bandwidth (Q1753090) (← links)
- A removal lemma for systems of linear equations over finite fields (Q1758978) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Star-critical Ramsey numbers for large generalized fans and books (Q1800410) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- Large generalized books are \(p\)-good (Q1880791) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- The number of 3-SAT functions (Q1936820) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Extremal problems and results related to Gallai-colorings (Q1981696) (← links)
- Non-Hermitian random matrices with a variance profile. I: Deterministic equivalents and limiting esds (Q1994518) (← links)
- \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
- Regularity lemmas for clustering graphs (Q2020028) (← links)
- \(p\)-arrangeable graphs are Folkman linear (Q2025193) (← links)
- Ramsey numbers of large books and bipartite graphs with small bandwidth (Q2032748) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Small rainbow cliques in randomly perturbed dense graphs (Q2065991) (← links)
- Threshold Ramsey multiplicity for paths and even cycles (Q2080232) (← links)
- Star-critical Ramsey numbers involving large books (Q2112652) (← links)
- Ramsey numbers of fans and large books (Q2121798) (← links)
- Tilings in vertex ordered graphs (Q2131863) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- On a colored Turán problem of Diwan and Mubayi (Q2144601) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- Powers of Hamilton cycles of high discrepancy are unavoidable (Q2161210) (← links)