The following pages link to Holes in graphs (Q5954318):
Displaying 18 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Small subsets inherit sparse \(\varepsilon\)-regularity (Q858679) (← links)
- A characterization for sparse \(\varepsilon\)-regular pairs (Q870053) (← links)
- Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs (Q1045170) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma (Q1964595) (← links)
- Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite (Q2380453) (← links)
- GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE (Q3367772) (← links)
- Regular pairs in sparse random graphs I (Q4419289) (← links)
- On the number of symbols that forces a transversal (Q4993090) (← links)
- Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs (Q5020839) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- A further extension of Rödl's theorem (Q6133166) (← links)
- Regular decomposition of the edge set of a graph with applications (Q6562433) (← links)
