Forcing spanning subgraphs via Ore type conditions

Böttcher, J., K. P. Pruessmann, A. Taraz and A. Würfl, Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs, submitted Böttcher, 2008, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, J. Comb. Theory, Ser. B, 98, 752, 10.1016/j.jctb.2007.11.005 Hajnal, 1970, Proof of a conjecture of P. Erdős, 601 Kierstead, 2008, An Ore-type theorem on equitable coloring, J. Comb. Theory, Ser. B, 98, 226, 10.1016/j.jctb.2007.07.003 Komlós, 1996, On the square of a Hamiltonian cycle in dense graphs, Random Structures Algorithms, 9, 193, 10.1002/(SICI)1098-2418(199608/09)9:1/2<193::AID-RSA12>3.0.CO;2-P Komlós, 1997, Blow-up lemma, Combinatorica, 17, 109, 10.1007/BF01196135 Ore, 1960, Note on Hamilton circuits, Am. Math. Mon., 67, 55, 10.2307/2308928 Szemerédi, E., Regular partitions of graphs., Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No.260, 399-401 (1978)