Matches in SemOpenAlex for { <https://semopenalex.org/work/W4236979380> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W4236979380 endingPage "282" @default.
- W4236979380 startingPage "275" @default.
- W4236979380 abstract "The Hajnal-Szemerédi Theorem [Hajnal & Szemerédi, Colloq Math Soc J Bolyai, 1970] states that a graph with hk vertices and minimum degree at least (h − 1)k contains k vertex disjoint copies of Kh. Its proof is not algorithmic. Here, we present an algorithm that, for a fixed h, finds in such a graph k − C(h) vertex disjoint copies of Kh in polynomial time in k, C(h) being a constant depending on h only. The proof suggests a variant of the theorem for h-partite graphs, which is conjectured here and proven in a slightly weaker form in some special cases. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 275–282, 1999" @default.
- W4236979380 created "2022-05-12" @default.
- W4236979380 creator A5036603247 @default.
- W4236979380 date "1999-08-01" @default.
- W4236979380 modified "2023-10-16" @default.
- W4236979380 title "Variants of the Hajnal-Szemer�di Theorem" @default.
- W4236979380 cites W1994422705 @default.
- W4236979380 cites W2018839087 @default.
- W4236979380 cites W2094126876 @default.
- W4236979380 cites W4212784735 @default.
- W4236979380 cites W4361866456 @default.
- W4236979380 doi "https://doi.org/10.1002/(sici)1097-0118(199908)31:4<275::aid-jgt2>3.0.co;2-f" @default.
- W4236979380 hasPublicationYear "1999" @default.
- W4236979380 type Work @default.
- W4236979380 citedByCount "21" @default.
- W4236979380 countsByYear W42369793802012 @default.
- W4236979380 countsByYear W42369793802013 @default.
- W4236979380 countsByYear W42369793802015 @default.
- W4236979380 countsByYear W42369793802016 @default.
- W4236979380 countsByYear W42369793802017 @default.
- W4236979380 countsByYear W42369793802018 @default.
- W4236979380 countsByYear W42369793802019 @default.
- W4236979380 countsByYear W42369793802020 @default.
- W4236979380 countsByYear W42369793802022 @default.
- W4236979380 countsByYear W42369793802023 @default.
- W4236979380 crossrefType "journal-article" @default.
- W4236979380 hasAuthorship W4236979380A5036603247 @default.
- W4236979380 hasConcept C114614502 @default.
- W4236979380 hasConcept C118615104 @default.
- W4236979380 hasConcept C132525143 @default.
- W4236979380 hasConcept C33923547 @default.
- W4236979380 hasConcept C45340560 @default.
- W4236979380 hasConcept C80899671 @default.
- W4236979380 hasConceptScore W4236979380C114614502 @default.
- W4236979380 hasConceptScore W4236979380C118615104 @default.
- W4236979380 hasConceptScore W4236979380C132525143 @default.
- W4236979380 hasConceptScore W4236979380C33923547 @default.
- W4236979380 hasConceptScore W4236979380C45340560 @default.
- W4236979380 hasConceptScore W4236979380C80899671 @default.
- W4236979380 hasIssue "4" @default.
- W4236979380 hasLocation W42369793801 @default.
- W4236979380 hasOpenAccess W4236979380 @default.
- W4236979380 hasPrimaryLocation W42369793801 @default.
- W4236979380 hasRelatedWork W1553466895 @default.
- W4236979380 hasRelatedWork W1971174658 @default.
- W4236979380 hasRelatedWork W2062850566 @default.
- W4236979380 hasRelatedWork W2099195351 @default.
- W4236979380 hasRelatedWork W2171695875 @default.
- W4236979380 hasRelatedWork W2348092930 @default.
- W4236979380 hasRelatedWork W26693340 @default.
- W4236979380 hasRelatedWork W4256429076 @default.
- W4236979380 hasRelatedWork W4301046126 @default.
- W4236979380 hasRelatedWork W4308716484 @default.
- W4236979380 hasVolume "31" @default.
- W4236979380 isParatext "false" @default.
- W4236979380 isRetracted "false" @default.
- W4236979380 workType "article" @default.