DOCSLIB.ORG

CS311H: Discrete Mathematics Introduction to Graph Theory Announcements Directed Graphs In-Degree and Out-Degree of Directed

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CS311H: Discrete Mathematics Introduction to Graph Theory Announcements Directed Graphs In-Degree and Out-Degree of Directed Announcements CS311H: Discrete Mathematics Introduction to Graph Theory I Homeworkdue now! I Next HW out, due next Tuesday Instructor: I¸sıl Dillig I Midterm 2 next Thursday!! Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 1/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 2/34 Directed Graphs In-Degree and Out-Degree of Directed Graphs I All graphs we considered so far are undirected I In undirected graphs, edge (u, v) same as (v, u) I The in-degree of a vertex v, written deg−(v), is the number I A directed edge (arc) is an ordered pair (u, v) of edges going into v (i.e., (u, v) not same as (v, u)) I deg−(a) = I A directed graph is a graph with directed edges + I The out-degree of a vertex v, written deg (v), is the number of edges leaving v + I deg (a) = Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 3/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 4/34 Handshaking Theorem for Directed Graphs Subgraphs Let G = (V , E) be a directed graph. Then: I A graph G = (V , E) is a subgraph of another graph + deg−(v) = deg (v) = E G0 = (V 0, E 0) if V V 0 and E E 0 | | ⊆ ⊆ v V v V X∈ X∈ I Example: I v V deg−(v) = ∈ P + I v V deg (v) = ∈ P I Graph G is a proper subgraph of G if G = G . 0 6 0 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 5/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 6/34 1 Question Induced Subgraph I Consider a graph G = (V , E) and a set of vertices V 0 such that V V Consider a graph G with vertices v , v , v , v and edges 0 ⊆ { 1 2 3 4} (v , v ), (v , v ), (v , v ). 1 3 1 4 2 3 I Graph G0 is the induced subgraph of G with respect to V 0 if: Which of the following are subgraphs of G? 1. G0 contains exactly those vertices in V 0 2. For all u, v V 0, edge (u, v) G0 iff (u, v) G 1. Graph G1 with vertex v1 and edge (v1, v3) ∈ ∈ ∈ 2. Graph G with vertices v , v and no edges I Subgraph induced by vertices C , D : 2 { 1 3} { } 3. Graph G with vertices v , v and edge (v , v ) 3 { 1 2} 1 2 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 7/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 8/34 Complete Graphs Bipartite graphs I A simple undirected graph G = (V , E) is called bipartite if V I A complete graph is a simple undirected graph in which every can be partitioned into two disjoint sets V1 and V2 such that pair of vertices is connected by one edge. every edge in E connects a V1 vertex to a V2 vertex C A D EB I How many edges does a complete graph with n vertices have? Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 9/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 10/34 Examples Bipartite and Non-Bi-partite Graphs Questions about Bipartite Graphs I Is this graph bipartite? A I Does there exist a complete graph that is also bipartite? B C I What about this graph? A E I Consider a graph G with 5 nodes and 7 edges. Can G be C bipartite? D B F Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 11/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 12/34 2 Graph Coloring Question I A coloring of a graph is the assignment of a color to each vertex so that no two adjacent Consider a graph G with vertices v1, v2, v3, v4 and edges vertices are assigned the same color. { } (v1, v2), (v1, v3), (v2, v3), (v2, v4). I A graph is k-colorable if it is possible to color it using k colors. Which of the following are valid colorings for G? I e.g., graph on left is 3-colorable 1. v1 = red, v2 = green, v3 = blue I Is it also 2-colorable? 2. v1 = red, v2= green, v3 = blue, v4 = red I The chromatic number of a graph is the least number of 3. v1 = red, v2= green, v3 = red, v4 = blue colors needed to color it. I What is the chromatic number of this graph? Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 13/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 14/34 Examples Applications of Graph Coloring I Graph coloring has lots of applications, particularly in scheduling. What are the chromatic numbers for these graphs? A B A B A B I Example: What’s the minimum number of time slots needed so that no student is enrolled in conflicting classes? C D C D C D 311 314 312 331 429 439 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 15/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 16/34 Bipartite Graphs and Colorability Complete graphs and Colorability Prove that a graph G = (V , E) is bipartite if and only if it is Prove that any complete graph Kn has chromatic number n. 2-colorable. Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 17/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 18/34 3 Degree and Colorability Degree and Colorability, cont. Theorem: Every simple graph G is always max degree(G) + 1 colorable. I Remove v and all its incident edges from G; call this G0. I Proof is by induction on the number of vertices n. I By the IH, G0 is max degree(G0) + 1 colorable. I Let P(n) be the predicate “A simple graph G with n vertices I Let C 0 be the coloring of G0: Suppose C 0 assigns colors is max-degree(G)-colorable” c ,..., c to v’s n neighbors. Clearly, p n. 1 p ≤ I Base case: n = 1. If graph has only one node, then it cannot I Now, create coloring C for G: have any edges. Hence, it is 1-colorable. I C (v 0) = C 0(v 0) for any v = v 0 6 I Induction: Consider a graph G = (V , E) with k + 1 vertices. I C (v) = cp+1 I Now consider arbitrary v V with neighnors v ,..., v ∈ 1 n Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 19/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 20/34 Degree and Colorability, cont. Star Graphs and Colorability I Two possibilities: (i) cp+1 was used in C 0, or (ii) new color I Case 1: Then, G is max degree(G0) + 1 colorable, and I A star graph Sn is a graph with one therefore max degree(G) + 1 colorable. vertex u at the center and the only edges are from u to each of v1,..., vn 1. − I Case 2: Coloring C uses p + 1 colors. I Draw S4. I We know p n, where n is num neighbors ≤ I What is the chromatic number of Sn ? I What can we say about max degree(G)? I Thus, p + 1 max degree(G) + 1 ≤ Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 21/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 22/34 Question About Star Graphs Connectivity in Graphs a Suppose we have two star graphs Sk and Sm . Now, pick a random vertex from each graph and connect them with an edge. b I Typical question: Is it possible to get from some node u to another node v? Which of the following statements must be true about the x resulting graph G? w I Example: Train network – if there is path from u to v, possible to take train from u to u 1. The chromatic number of G is 3 y v and vice versa. v 2. G is 2-colorable. d I If it’s possible to get from u to v, we say u and v are connected and there is a path between u and v 3. max degree(G) = max(k, m). c Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 23/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 24/34 4 Paths Example I A path between u and v is a sequence of edges that starts at vertex u, moves along adjacent edges, and ends in v. I Consider a graph with vertices x, y, z, w and edges { } (x, y), (x, w), (x, z), (y, z) I Example: u, x, y, w is a path, but u, y, v and u, a, x are not I What are all the simple paths from z to w? I Length of a path is the number of edges I What are all the simple paths from x to y? traversed, e.g., length of u, x, y, w is 3 I How many paths (can be non-simple) are there from x to y? I A simple path is a path that does not repeat any edges I u, x, y, w is a simple path but u, x, u is not Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 25/34 Instructor: I¸sıl Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 26/34 Connectedness Example I Prove: Suppose graph G has exactly two vertices of odd I A graph is connected if there is a path degree, say u and v.
Load more

Recommended publications
  • Directed Graph Algorithms
    Directed Graph Algorithms CSE 373 Data Structures Readings • Reading Chapter 13 › Sections 13.3 and 13.4 Digraphs 2 Topological Sort 142 322 143 321 Problem: Find an order in which all these courses can 326 be taken. 370 341 Example: 142 Æ 143 Æ 378 Æ 370 Æ 321 Æ 341 Æ 322 Æ 326 Æ 421 Æ 401 378 421 In order to take a course, you must 401 take all of its prerequisites first Digraphs 3 Topological Sort Given a digraph G = (V, E), find a linear ordering of its vertices such that: for any edge (v, w) in E, v precedes w in the ordering B C A F D E Digraphs 4 Topo sort – valid solution B C Any linear ordering in which A all the arrows go to the right F is a valid solution D E A B F C D E Note that F can go anywhere in this list because it is not connected. Also the solution is not unique. Digraphs 5 Topo sort – invalid solution B C A Any linear ordering in which an arrow goes to the left F is not a valid solution D E A B F C E D NO! Digraphs 6 Paths and Cycles • Given a digraph G = (V,E), a path is a sequence of vertices v1,v2, …,vk such that: ›(vi,vi+1) in E for 1 < i < k › path length = number of edges in the path › path cost = sum of costs of each edge • A path is a cycle if : › k > 1; v1 = vk •G is acyclic if it has no cycles.
    [Show full text]
  • On Treewidth and Graph Minors
    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
    [Show full text]
  • Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities
    Discussiones Mathematicae General Algebra and Applications 40 (2020) 143–157 doi:10.7151/dmgaa.1344 GRAPH VARIETIES AXIOMATIZED BY SEMIMEDIAL, MEDIAL, AND SOME OTHER GROUPOID IDENTITIES Erkko Lehtonen Technische Universit¨at Dresden Institut f¨ur Algebra 01062 Dresden, Germany e-mail: [email protected] and Chaowat Manyuen Department of Mathematics, Faculty of Science Khon Kaen University Khon Kaen 40002, Thailand e-mail: [email protected] Abstract Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph varieties axiomatized by certain groupoid identities (medial, semimedial, autodis- tributive, commutative, idempotent, unipotent, zeropotent, alternative). Keywords: graph algebra, groupoid, identities, semimediality, mediality. 2010 Mathematics Subject Classification: 05C25, 03C05. 1. Introduction Graph algebras were introduced by Shallon [10] in 1979 with the purpose of providing examples of nonfinitely based finite algebras. Let us briefly recall this concept. Given a directed graph G = (V, E) without multiple edges, the graph algebra associated with G is the algebra A(G) = (V ∪ {∞}, ◦, ∞) of type (2, 0), 144 E. Lehtonen and C. Manyuen where ∞ is an element not belonging to V and the binary operation ◦ is defined by the rule u, if (u, v) ∈ E, u ◦ v := (∞, otherwise, for all u, v ∈ V ∪ {∞}. We will denote the product u ◦ v simply by juxtaposition uv. Using this representation, we may view any algebraic property of a graph algebra as a property of the graph with which it is associated.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
    [Show full text]
  • Structural Graph Theory Meets Algorithms: Covering And
    Structural Graph Theory Meets Algorithms: Covering and Connectivity Problems in Graphs Saeed Akhoondian Amiri Fakult¨atIV { Elektrotechnik und Informatik der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften Dr. rer. nat. genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Rolf Niedermeier Gutachter: Prof. Dr. Stephan Kreutzer Gutachter: Prof. Dr. Marcin Pilipczuk Gutachter: Prof. Dr. Dimitrios Thilikos Tag der wissenschaftlichen Aussprache: 13. October 2017 Berlin 2017 2 This thesis is dedicated to my family, especially to my beautiful wife Atefe and my lovely son Shervin. 3 Contents Abstract iii Acknowledgementsv I. Introduction and Preliminaries1 1. Introduction2 1.0.1. General Techniques and Models......................3 1.1. Covering Problems.................................6 1.1.1. Covering Problems in Distributed Models: Case of Dominating Sets.6 1.1.2. Covering Problems in Directed Graphs: Finding Similar Patterns, the Case of Erd}os-P´osaproperty.......................9 1.2. Routing Problems in Directed Graphs...................... 11 1.2.1. Routing Problems............................. 11 1.2.2. Rerouting Problems............................ 12 1.3. Structure of the Thesis and Declaration of Authorship............. 14 2. Preliminaries and Notations 16 2.1. Basic Notations and Defnitions.......................... 16 2.1.1. Sets..................................... 16 2.1.2. Graphs................................... 16 2.2. Complexity Classes................................
    [Show full text]
  • Katz Centrality for Directed Graphs • Understand How Katz Centrality Is an Extension of Eigenvector Centrality to Learning Directed Graphs
    Prof. Ralucca Gera, [email protected] Applied Mathematics Department, ExcellenceNaval Postgraduate Through Knowledge School MA4404 Complex Networks Katz Centrality for directed graphs • Understand how Katz centrality is an extension of Eigenvector Centrality to Learning directed graphs. Outcomes • Compute Katz centrality per node. • Interpret the meaning of the values of Katz centrality. Recall: Centralities Quality: what makes a node Mathematical Description Appropriate Usage Identification important (central) Lots of one-hop connections The number of vertices that Local influence Degree from influences directly matters deg Small diameter Lots of one-hop connections The proportion of the vertices Local influence Degree centrality from relative to the size of that influences directly matters deg C the graph Small diameter |V(G)| Lots of one-hop connections A weighted degree centrality For example when the Eigenvector centrality to high centrality vertices based on the weight of the people you are (recursive formula): neighbors (instead of a weight connected to matter. ∝ of 1 as in degree centrality) Recall: Strongly connected Definition: A directed graph D = (V, E) is strongly connected if and only if, for each pair of nodes u, v ∈ V, there is a path from u to v. • The Web graph is not strongly connected since • there are pairs of nodes u and v, there is no path from u to v and from v to u. • This presents a challenge for nodes that have an in‐degree of zero Add a link from each page to v every page and give each link a small transition probability controlled by a parameter β. u Source: http://en.wikipedia.org/wiki/Directed_acyclic_graph 4 Katz Centrality • Recall that the eigenvector centrality is a weighted degree obtained from the leading eigenvector of A: A x =λx , so its entries are 1 λ Thoughts on how to adapt the above formula for directed graphs? • Katz centrality: ∑ + β, Where β is a constant initial weight given to each vertex so that vertices with zero in degree (or out degree) are included in calculations.
    [Show full text]
  • A Gentle Introduction to Deep Learning for Graphs
    A Gentle Introduction to Deep Learning for Graphs Davide Bacciua, Federico Erricaa, Alessio Michelia, Marco Poddaa aDepartment of Computer Science, University of Pisa, Italy. Abstract The adaptive processing of graph data is a long-standing research topic that has been lately consolidated as a theme of major interest in the deep learning community. The snap increase in the amount and breadth of related research has come at the price of little systematization of knowledge and attention to earlier literature. This work is a tutorial introduction to the field of deep learn- ing for graphs. It favors a consistent and progressive presentation of the main concepts and architectural aspects over an exposition of the most recent liter- ature, for which the reader is referred to available surveys. The paper takes a top-down view of the problem, introducing a generalized formulation of graph representation learning based on a local and iterative approach to structured in- formation processing. Moreover, it introduces the basic building blocks that can be combined to design novel and effective neural models for graphs. We com- plement the methodological exposition with a discussion of interesting research challenges and applications in the field. Keywords: deep learning for graphs, graph neural networks, learning for structured data arXiv:1912.12693v2 [cs.LG] 15 Jun 2020 1. Introduction Graphs are a powerful tool to represent data that is produced by a variety of artificial and natural processes. A graph has a compositional nature, being a compound of atomic information pieces, and a relational nature, as the links defining its structure denote relationships between the linked entities.
    [Show full text]
  • Arxiv:2006.06067V2 [Math.CO] 4 Jul 2021
    Treewidth versus clique number. I. Graph classes with a forbidden structure∗† Cl´ement Dallard1 Martin Milaniˇc1 Kenny Storgelˇ 2 1 FAMNIT and IAM, University of Primorska, Koper, Slovenia 2 Faculty of Information Studies, Novo mesto, Slovenia [email protected] [email protected] [email protected] Treewidth is an important graph invariant, relevant for both structural and algo- rithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of large cliques. We study graph classes closed under taking induced subgraphs in which this condition is also sufficient, which we call (tw,ω)-bounded. Such graph classes are known to have useful algorithmic applications related to variants of the clique and k-coloring problems. We consider six well-known graph containment relations: the minor, topological minor, subgraph, induced minor, in- duced topological minor, and induced subgraph relations. For each of them, we give a complete characterization of the graphs H for which the class of graphs excluding H is (tw,ω)-bounded. Our results yield an infinite family of χ-bounded induced-minor-closed graph classes and imply that the class of 1-perfectly orientable graphs is (tw,ω)-bounded, leading to linear-time algorithms for k-coloring 1-perfectly orientable graphs for every fixed k. This answers a question of Breˇsar, Hartinger, Kos, and Milaniˇc from 2018, and one of Beisegel, Chudnovsky, Gurvich, Milaniˇc, and Servatius from 2019, respectively. We also reveal some further algorithmic implications of (tw,ω)- boundedness related to list k-coloring and clique problems. In addition, we propose a question about the complexity of the Maximum Weight Independent Set prob- lem in (tw,ω)-bounded graph classes and prove that the problem is polynomial-time solvable in every class of graphs excluding a fixed star as an induced minor.
    [Show full text]
  • Graph Mining: Social Network Analysis and Information Diffusion
    Graph Mining: Social network analysis and Information Diffusion Davide Mottin, Konstantina Lazaridou Hasso Plattner Institute Graph Mining course Winter Semester 2016 Lecture road Introduction to social networks Real word networks’ characteristics Information diffusion GRAPH MINING WS 2016 2 Paper presentations ▪ Link to form: https://goo.gl/ivRhKO ▪ Choose the date(s) you are available ▪ Choose three papers according to preference (there are three lists) ▪ Choose at least one paper for each course part ▪ Register to the mailing list: https://lists.hpi.uni-potsdam.de/listinfo/graphmining-ws1617 GRAPH MINING WS 2016 3 What is a social network? ▪Oxford dictionary A social network is a network of social interactions and personal relationships GRAPH MINING WS 2016 4 What is an online social network? ▪ Oxford dictionary An online social network (OSN) is a dedicated website or other application, which enables users to communicate with each other by posting information, comments, messages, images, etc. ▪ Computer science : A network that consists of a finite number of users (nodes) that interact with each other (edges) by sharing information (labels, signs, edge directions etc.) GRAPH MINING WS 2016 5 Definitions ▪Vertex/Node : a user of the social network (Twitter user, an author in a co-authorship network, an actor etc.) ▪Edge/Link/Tie : the connection between two vertices referring to their relationship or interaction (friend-of relationship, re-tweeting activity, etc.) Graph G=(V,E) symbols meaning V users E connections deg(u) node degree:
    [Show full text]
  • Arxiv:1906.05510V2 [Math.AC]
    BINOMIAL EDGE IDEALS OF COGRAPHS THOMAS KAHLE AND JONAS KRUSEMANN¨ Abstract. We determine the Castelnuovo–Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with n vertices the maximum regularity grows as 2n/3. We also bound the regularity by graph theoretic invariants and construct a family of counterexamples to a conjecture of Hibi and Matsuda. 1. Introduction Let G = ([n], E) be a simple undirected graph on the vertex set [n]= {1,...,n}. x1 ··· xn x1 ··· xn Let X = ( y1 ··· yn ) be a generic 2 × n matrix and S = k[ y1 ··· yn ] the polynomial ring whose indeterminates are the entries of X and with coefficients in a field k. The binomial edge ideal of G is JG = hxiyj −yixj : {i, j} ∈ Ei⊆ S, the ideal of 2×2 mi- nors indexed by the edges of the graph. Since their inception in [5, 15], connecting combinatorial properties of G with algebraic properties of JG or S/ JG has been a popular activity. Particular attention has been paid to the minimal free resolution of S/ JG as a standard N-graded S-module [3, 11]. The data of a minimal free res- olution is encoded in its graded Betti numbers βi,j (S/ JG) = dimk Tori(S/ JG, k)j . An interesting invariant is the highest degree appearing in the resolution, the Castelnuovo–Mumford regularity reg(S/ JG) = max{j − i : βij (S/ JG) 6= 0}. It is a complexity measure as low regularity implies favorable properties like vanish- ing of local cohomology. Binomial edge ideals have square-free initial ideals by arXiv:1906.05510v2 [math.AC] 10 Mar 2021 [5, Theorem 2.1] and, using [1], this implies that the extremal Betti numbers and regularity can also be derived from those initial ideals.
    [Show full text]
  • A Faster Parameterized Algorithm for PSEUDOFOREST DELETION
    A faster parameterized algorithm for PSEUDOFOREST DELETION Citation for published version (APA): Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). A faster parameterized algorithm for PSEUDOFOREST DELETION. Discrete Applied Mathematics, 236, 42-56. https://doi.org/10.1016/j.dam.2017.10.018 Document license: Unspecified DOI: 10.1016/j.dam.2017.10.018 Document status and date: Published: 19/02/2018 Document Version: Accepted manuscript including changes made at the peer-review stage Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Treewidth-Erickson.Pdf
    Computational Topology (Jeff Erickson) Treewidth Or il y avait des graines terribles sur la planète du petit prince . c’étaient les graines de baobabs. Le sol de la planète en était infesté. Or un baobab, si l’on s’y prend trop tard, on ne peut jamais plus s’en débarrasser. Il encombre toute la planète. Il la perfore de ses racines. Et si la planète est trop petite, et si les baobabs sont trop nombreux, ils la font éclater. [Now there were some terrible seeds on the planet that was the home of the little prince; and these were the seeds of the baobab. The soil of that planet was infested with them. A baobab is something you will never, never be able to get rid of if you attend to it too late. It spreads over the entire planet. It bores clear through it with its roots. And if the planet is too small, and the baobabs are too many, they split it in pieces.] — Antoine de Saint-Exupéry (translated by Katherine Woods) Le Petit Prince [The Little Prince] (1943) 11 Treewidth In this lecture, I will introduce a graph parameter called treewidth, that generalizes the property of having small separators. Intuitively, a graph has small treewidth if it can be recursively decomposed into small subgraphs that have small overlap, or even more intuitively, if the graph resembles a ‘fat tree’. Many problems that are NP-hard for general graphs can be solved in polynomial time for graphs with small treewidth. Graphs embedded on surfaces of small genus do not necessarily have small treewidth, but they can be covered by a small number of subgraphs, each with small treewidth.
    [Show full text]