FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1964700291> ?p ?o ?g. }

• W1964700291 endingPage "15" @default.
• W1964700291 startingPage "8" @default.
• W1964700291 abstract "Following this advice, we should look over the big questions, then doodle and sketch out some approaches. If you are an expert, then this is easy to do, but most people do not want to wait to become an expert before looking at interesting problems. Graph theory, our area of expertise, has many hard-to-solve questions. Some hark back to the recreational roots of the area yet still keep their mystery. These ‘‘acorns’’ can be planted on the backs of envelopes, on a blackboard, and over a coffee. Our goal is to collect some of these conjectures—arguably some of the most intriguing—in one place. We present ten conjectures in graph theory, and you can read about each one in at most ten minutes. As we live in the era of Twitter, all the conjectures we state are 140 characters or fewer (so ‘‘minute’’ here has a double meaning). We might even call these sketchy tweets, as we present examples for each conjecture that you can doodle on as you read. Hamming also references ambiguity: good researchers can work both on proving and disproving the same statement, so we approach the conjectures with an open mind. He also mentions that a good approach is to reframe the problem, and change the point of view. One example from Vizing’s Conjecture (which is discussed as our second-to-last conjecture in the following text), is the three-page paper [2] which, with a new way of thinking, reduced most of the published work of twenty years to a corollary of its main result! Given the size of modern graph theory, with its many smaller subfields (such as structural graph theory, random graphs, topological graph theory, graph algorithms, spectral graph theory, graph minors, and graph homomorphisms, to name a few), it would be impossible to list all, or even the bulk of the conjectures in the field. We are content instead to focus on a few family jewels, which have an intrinsic beauty and have provided some challenges for graph-theorists for at least two decades. There is something for everyone here, from undergraduate students taking their first course in graph theory, to seasoned researchers in the field. For additional reading on problems and conjectures in graph theory and other fields, see the Open Problem Garden maintained by IRMACS at Simon Fraser University [24]. We consider only finite and undirected graphs, with no multiple edges or loops (unless otherwise stated). We assume the reader has some basic familiarity with graphs and their terminology, including notions such as cycles, paths, complete graphs, complete bipartite graphs, vertex degrees, and connected graphs. We use the notation Cn for the cycle with n vertices, Pn for the path with n vertices, and Kn for the complete graph with n vertices. The complete bipartite graph with m and n vertices of the respective colors is denoted by Km,n. All the background we need can be found in any text in graph theory, such as those of Diestel [9] and West [41], or online (see for example [42])." @default.
• W1964700291 created "2016-06-24" @default.
• W1964700291 creator A5080800191 @default.
• W1964700291 creator A5082423050 @default.
• W1964700291 date "2012-02-21" @default.
• W1964700291 modified "2023-09-25" @default.
• W1964700291 title "Sketchy Tweets: Ten Minute Conjectures in Graph Theory" @default.
• W1964700291 cites W1483461381 @default.
• W1964700291 cites W1520619927 @default.
• W1964700291 cites W1967516408 @default.
• W1964700291 cites W1973343935 @default.
• W1964700291 cites W1975659026 @default.
• W1964700291 cites W1992843513 @default.
• W1964700291 cites W2003824380 @default.
• W1964700291 cites W2015309545 @default.
• W1964700291 cites W2022623224 @default.
• W1964700291 cites W2030551570 @default.
• W1964700291 cites W2032958186 @default.
• W1964700291 cites W2045472305 @default.
• W1964700291 cites W2068987903 @default.
• W1964700291 cites W2071321409 @default.
• W1964700291 cites W2073039945 @default.
• W1964700291 cites W2086778098 @default.
• W1964700291 cites W2088648195 @default.
• W1964700291 cites W2095689360 @default.
• W1964700291 cites W2314361409 @default.
• W1964700291 cites W280278083 @default.
• W1964700291 cites W2989634522 @default.
• W1964700291 cites W4245585741 @default.
• W1964700291 cites W824928995 @default.
• W1964700291 cites W2071433024 @default.
• W1964700291 doi "https://doi.org/10.1007/s00283-012-9275-2" @default.
• W1964700291 hasPublicationYear "2012" @default.
• W1964700291 type Work @default.
• W1964700291 sameAs 1964700291 @default.
• W1964700291 citedByCount "1" @default.
• W1964700291 countsByYear W19647002912018 @default.
• W1964700291 crossrefType "journal-article" @default.
• W1964700291 hasAuthorship W1964700291A5080800191 @default.
• W1964700291 hasAuthorship W1964700291A5082423050 @default.
• W1964700291 hasBestOaLocation W19647002912 @default.
• W1964700291 hasConcept C114614502 @default.
• W1964700291 hasConcept C199360897 @default.
• W1964700291 hasConcept C2524010 @default.
• W1964700291 hasConcept C2780522230 @default.
• W1964700291 hasConcept C2780990831 @default.
• W1964700291 hasConcept C28719098 @default.
• W1964700291 hasConcept C33923547 @default.
• W1964700291 hasConcept C41008148 @default.
• W1964700291 hasConceptScore W1964700291C114614502 @default.
• W1964700291 hasConceptScore W1964700291C199360897 @default.
• W1964700291 hasConceptScore W1964700291C2524010 @default.
• W1964700291 hasConceptScore W1964700291C2780522230 @default.
• W1964700291 hasConceptScore W1964700291C2780990831 @default.
• W1964700291 hasConceptScore W1964700291C28719098 @default.
• W1964700291 hasConceptScore W1964700291C33923547 @default.
• W1964700291 hasConceptScore W1964700291C41008148 @default.
• W1964700291 hasIssue "1" @default.
• W1964700291 hasLocation W19647002911 @default.
• W1964700291 hasLocation W19647002912 @default.
• W1964700291 hasOpenAccess W1964700291 @default.
• W1964700291 hasPrimaryLocation W19647002911 @default.
• W1964700291 hasRelatedWork W137443827 @default.
• W1964700291 hasRelatedWork W1558015270 @default.
• W1964700291 hasRelatedWork W1864540578 @default.
• W1964700291 hasRelatedWork W2183497771 @default.
• W1964700291 hasRelatedWork W2340365916 @default.
• W1964700291 hasRelatedWork W2586985375 @default.
• W1964700291 hasRelatedWork W2802568653 @default.
• W1964700291 hasRelatedWork W2884786993 @default.
• W1964700291 hasRelatedWork W2952408444 @default.
• W1964700291 hasRelatedWork W2956294838 @default.
• W1964700291 hasRelatedWork W2990887983 @default.
• W1964700291 hasRelatedWork W3095142801 @default.
• W1964700291 hasRelatedWork W3123169012 @default.
• W1964700291 hasRelatedWork W3297276 @default.
• W1964700291 hasRelatedWork W561045285 @default.
• W1964700291 hasRelatedWork W562185861 @default.
• W1964700291 hasRelatedWork W2184635276 @default.
• W1964700291 hasRelatedWork W2888096315 @default.
• W1964700291 hasRelatedWork W2944729808 @default.
• W1964700291 hasRelatedWork W3143837891 @default.
• W1964700291 hasVolume "34" @default.
• W1964700291 isParatext "false" @default.
• W1964700291 isRetracted "false" @default.
• W1964700291 magId "1964700291" @default.
• W1964700291 workType "article" @default.