Matches in SemOpenAlex for { <https://semopenalex.org/work/W2963861976> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W2963861976 endingPage "226" @default.
- W2963861976 startingPage "219" @default.
- W2963861976 abstract "Abstract The Erdős–Gallai Theorem states that for k ≥ 3 every graph on n vertices with more than 1 2 ( k − 1 ) ( n − 1 ) edges contains a cycle of length at least k. Kopylov proved a strengthening of this result for 2-connected graphs with extremal examples H n , k , t and H n , k , 2 . In this note, we generalize the result of Kopylov to bound the number of s-cliques in a graph with circumference less than k. Furthermore, we show that the same extremal examples that maximize the number of edges also maximize the number of cliques of any fixed size. Finally, we obtain the extremal number of s-cliques in a graph with no path on k-vertices." @default.
- W2963861976 created "2019-07-30" @default.
- W2963861976 creator A5079041534 @default.
- W2963861976 date "2018-01-01" @default.
- W2963861976 modified "2023-10-12" @default.
- W2963861976 title "The maximum number of cliques in graphs without long cycles" @default.
- W2963861976 cites W1533675320 @default.
- W2963861976 cites W1990386955 @default.
- W2963861976 cites W1990486130 @default.
- W2963861976 cites W1996106086 @default.
- W2963861976 cites W2003298043 @default.
- W2963861976 cites W2013425391 @default.
- W2963861976 cites W2065663455 @default.
- W2963861976 cites W2066118197 @default.
- W2963861976 cites W2073268088 @default.
- W2963861976 cites W2083978161 @default.
- W2963861976 cites W2962990090 @default.
- W2963861976 doi "https://doi.org/10.1016/j.jctb.2017.08.005" @default.
- W2963861976 hasPublicationYear "2018" @default.
- W2963861976 type Work @default.
- W2963861976 sameAs 2963861976 @default.
- W2963861976 citedByCount "49" @default.
- W2963861976 countsByYear W29638619762017 @default.
- W2963861976 countsByYear W29638619762018 @default.
- W2963861976 countsByYear W29638619762019 @default.
- W2963861976 countsByYear W29638619762020 @default.
- W2963861976 countsByYear W29638619762021 @default.
- W2963861976 countsByYear W29638619762022 @default.
- W2963861976 countsByYear W29638619762023 @default.
- W2963861976 crossrefType "journal-article" @default.
- W2963861976 hasAuthorship W2963861976A5079041534 @default.
- W2963861976 hasBestOaLocation W29638619761 @default.
- W2963861976 hasConcept C114614502 @default.
- W2963861976 hasConcept C33923547 @default.
- W2963861976 hasConcept C41008148 @default.
- W2963861976 hasConceptScore W2963861976C114614502 @default.
- W2963861976 hasConceptScore W2963861976C33923547 @default.
- W2963861976 hasConceptScore W2963861976C41008148 @default.
- W2963861976 hasFunder F4320306076 @default.
- W2963861976 hasLocation W29638619761 @default.
- W2963861976 hasLocation W29638619762 @default.
- W2963861976 hasOpenAccess W2963861976 @default.
- W2963861976 hasPrimaryLocation W29638619761 @default.
- W2963861976 hasRelatedWork W1974891317 @default.
- W2963861976 hasRelatedWork W1978042415 @default.
- W2963861976 hasRelatedWork W2017331178 @default.
- W2963861976 hasRelatedWork W2044189972 @default.
- W2963861976 hasRelatedWork W2260035625 @default.
- W2963861976 hasRelatedWork W2748952813 @default.
- W2963861976 hasRelatedWork W2899084033 @default.
- W2963861976 hasRelatedWork W2913765211 @default.
- W2963861976 hasRelatedWork W2976797620 @default.
- W2963861976 hasRelatedWork W3086542228 @default.
- W2963861976 hasVolume "128" @default.
- W2963861976 isParatext "false" @default.
- W2963861976 isRetracted "false" @default.
- W2963861976 magId "2963861976" @default.
- W2963861976 workType "article" @default.