Matches in SemOpenAlex for { <https://semopenalex.org/work/W2950201098> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W2950201098 abstract "Let D be an arbitrary subset of the natural numbers. For every n, let M(n;D) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph K_n such that the union of any two paths from the family contains a not necessarily induced cycle of some length from D. We determine or bound the asymptotics of M(n;D) in various special cases. This problem is closely related to that of the permutation capacity of graphs and constitutes a further extension of the problem area around Shannon capacity. We also discuss how to generalize our cycle-difference problems and present an example where cycles are replaced by 4-cliques. These problems are in a natural duality to those of graph intersection, initiated by Erdos, Simonovits and Sos. The lack of kernel structure as a natural candidate for optimum makes our problems quite challenging." @default.
- W2950201098 created "2019-06-27" @default.
- W2950201098 creator A5025072538 @default.
- W2950201098 creator A5044667762 @default.
- W2950201098 creator A5081660521 @default.
- W2950201098 date "2011-06-19" @default.
- W2950201098 modified "2023-09-23" @default.
- W2950201098 title "Families of graph-different Hamilton paths" @default.
- W2950201098 cites W1028621989 @default.
- W2950201098 cites W2001790875 @default.
- W2950201098 cites W2055446353 @default.
- W2950201098 cites W2164684058 @default.
- W2950201098 hasPublicationYear "2011" @default.
- W2950201098 type Work @default.
- W2950201098 sameAs 2950201098 @default.
- W2950201098 citedByCount "0" @default.
- W2950201098 crossrefType "posted-content" @default.
- W2950201098 hasAuthorship W2950201098A5025072538 @default.
- W2950201098 hasAuthorship W2950201098A5044667762 @default.
- W2950201098 hasAuthorship W2950201098A5081660521 @default.
- W2950201098 hasConcept C114614502 @default.
- W2950201098 hasConcept C118615104 @default.
- W2950201098 hasConcept C124101348 @default.
- W2950201098 hasConcept C132525143 @default.
- W2950201098 hasConcept C33923547 @default.
- W2950201098 hasConcept C41008148 @default.
- W2950201098 hasConcept C86524685 @default.
- W2950201098 hasConcept C87117476 @default.
- W2950201098 hasConceptScore W2950201098C114614502 @default.
- W2950201098 hasConceptScore W2950201098C118615104 @default.
- W2950201098 hasConceptScore W2950201098C124101348 @default.
- W2950201098 hasConceptScore W2950201098C132525143 @default.
- W2950201098 hasConceptScore W2950201098C33923547 @default.
- W2950201098 hasConceptScore W2950201098C41008148 @default.
- W2950201098 hasConceptScore W2950201098C86524685 @default.
- W2950201098 hasConceptScore W2950201098C87117476 @default.
- W2950201098 hasOpenAccess W2950201098 @default.
- W2950201098 hasRelatedWork W1509696579 @default.
- W2950201098 hasRelatedWork W1903443809 @default.
- W2950201098 hasRelatedWork W1941378564 @default.
- W2950201098 hasRelatedWork W1980071981 @default.
- W2950201098 hasRelatedWork W2008769064 @default.
- W2950201098 hasRelatedWork W2074450708 @default.
- W2950201098 hasRelatedWork W2088125879 @default.
- W2950201098 hasRelatedWork W2104332107 @default.
- W2950201098 hasRelatedWork W2255497324 @default.
- W2950201098 hasRelatedWork W2257168763 @default.
- W2950201098 hasRelatedWork W2611420532 @default.
- W2950201098 hasRelatedWork W2749332180 @default.
- W2950201098 hasRelatedWork W2772122349 @default.
- W2950201098 hasRelatedWork W2897993996 @default.
- W2950201098 hasRelatedWork W2950266495 @default.
- W2950201098 hasRelatedWork W2966094451 @default.
- W2950201098 hasRelatedWork W3137997838 @default.
- W2950201098 hasRelatedWork W78868202 @default.
- W2950201098 hasRelatedWork W2276402578 @default.
- W2950201098 hasRelatedWork W3095896901 @default.
- W2950201098 isParatext "false" @default.
- W2950201098 isRetracted "false" @default.
- W2950201098 magId "2950201098" @default.
- W2950201098 workType "article" @default.