The following pages link to (Q4878666):
Displayed 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Ramsey numbers of a fixed odd-cycle and generalized books and fans (Q294540) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Maximum planar subgraphs in dense graphs (Q396794) (← links)
- Turán numbers of bipartite graphs plus an odd cycle (Q402594) (← links)
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Induced saturation number (Q456647) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- An extension of Turán's theorem, uniqueness and stability (Q463041) (← links)
- Deterministic vs non-deterministic graph property testing (Q480810) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- The critical window for the classical Ramsey-Turán problem (Q520045) (← links)
- On the density of a graph and its blowup (Q602726) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- The structure of almost all graphs in a hereditary property (Q631643) (← links)
- Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
- Edge distribution and density in the characteristic sequence (Q638472) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- Locating any two vertices on Hamiltonian cycles in large graphs (Q776260) (← links)
- On the cover Ramsey number of Berge hypergraphs (Q776301) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- A variant of the hypergraph removal lemma (Q855826) (← links)
- Small subsets inherit sparse \(\varepsilon\)-regularity (Q858679) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- The Ramsey number for a triple of long even cycles (Q885294) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma (Q926374) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Note on the 3-graph counting Lemma (Q941395) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)