Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/117502| Title: | The feasibility problem : the family F(G) of all 2 induced G-free graphs |
| Authors: | Caro, Yair Cassar, Matthew Lauri, Josef Zarb, Christina |
| Keywords: | Graph theory Graphic methods Mathematics -- Charts, diagrams, etc. |
| Issue Date: | 2023 |
| Citation: | Caro, Y., Cassar, M., Lauri, J., & Zarb, C. (2023). The feasibility problem : the family F(G) of all 2 induced G-free graphs. arXiv preprint arXiv:2311.01082. |
| Abstract: | An infinite family of graphs F is called feasible if for any pair of integers (n,m), n≥1, 0≤m≤(n2), there is a member G∈F such that G has n vertices and m edges. We prove that given a graph G, the family F(G) of all induced G-free graphs is feasible if and only if G is not Kk, Kk∖K2, Kk, Kk∖K2, for k≥2. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/117502 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| The_feasibility_problem_the_family_F(G)_of_all_2_induced_G_free_graphs_2023.pdf Restricted Access | 252.15 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.