pith. sign in

arxiv: 2408.02299 · v9 · submitted 2024-08-05 · 🧮 math.CO · cs.DM· cs.GT· cs.LO· math.LO

Various Properties of Various Ultrafilters, Various Graph Width Parameters, and Various Connectivity Systems (with Survey)

Takaaki Fujita This is my paper

Pith reviewed 2026-05-23 22:12 UTC · model grok-4.3

classification 🧮 math.CO cs.DMcs.GTcs.LOmath.LO
keywords ultrafiltersconnectivity systemsgraph width parameterssymmetric submodular functionsprefiltersgraph theorymatroid theory
0
0 comments X

The pith

Ultrafilters on connectivity systems connect to graph width parameters

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks to show that ultrafilters can be extended from their usual settings in topology and set theory to connectivity systems, defined as pairs consisting of a finite set and a symmetric submodular function. This extension is intended to link these ultrafilters with various graph width parameters and to develop results involving prefilters, ultra-prefilters, and filter subbases. It would matter to a sympathetic reader because it aims to broaden the study of graph structure by introducing additional parameters and offering a unified comparison of many width measures, drawing in ideas from lattice and matroid theory.

Core claim

On the paper's own terms, the central claim is that studying ultrafilters on connectivity systems yields connections to graph width parameters, permits development of several results on prefilters and related notions, and facilitates a survey and comparison of graph width parameters to provide a unified viewpoint, while highlighting links to set theory, lattice theory, and matroid theory.

What carries the argument

The connectivity system, a pair (X, f) with X finite and f a symmetric submodular function, which serves as the base for defining and studying ultrafilters in relation to graph widths.

If this is right

  • Several results on prefilters, ultra-prefilters, and filter subbases follow in this setting.
  • Additional width-, length-, and depth-type parameters arise naturally from the framework.
  • A wide range of graph width parameters can be compared to give a unified viewpoint for graph theory research.
  • Connections with set theory, lattice theory, and matroid theory are made explicit.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This could imply new structural theorems for graphs that are not yet explored in the paper.
  • The framework might be testable on specific graph classes like trees or planar graphs to see if new width parameters emerge.
  • Links to computational complexity could be pursued by examining how these ultrafilters affect algorithm design for width computation.

Load-bearing premise

The connectivity systems provide a natural enough generalization that classical ultrafilter properties extend to give new insights into graph width parameters.

What would settle it

An example of a connectivity system where the ultrafilter properties do not connect to any graph width parameter or where the developed results contradict known facts about graphs.

read the original abstract

This book studies ultrafilters on connectivity systems, that is, on pairs \((X,f)\) where \(X\) is a finite set and \(f:2^{X}\to \mathbb{N}\) is a symmetric submodular function. Ultrafilters, which play a fundamental role in topology and set theory, are considered here in this broader setting, with particular emphasis on their connections to graph width parameters and to the structural analysis of graph complexity. We develop several results on ultrafilters on connectivity systems and examine related notions such as prefilters, ultra-prefilters, and filter subbases. We also discuss additional width-, length-, and depth-type parameters that naturally arise in this framework, thereby broadening the perspective from which graph structure may be studied. In addition, the book compares a wide range of graph width parameters and related concepts, with the aim of providing a unified viewpoint and a useful point of departure for further research in graph theory and computational complexity. More broadly, the book highlights connections with several neighboring areas of mathematics, including set theory, lattice theory, and matroid theory. It also contains survey-style material intended to clarify the current landscape of graph width theory and to stimulate further developments in the subject.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript studies ultrafilters on connectivity systems (pairs (X,f) with X finite and f a symmetric submodular function), develops results on prefilters, ultra-prefilters and filter subbases, introduces additional width-, length- and depth-type parameters, compares a range of graph width parameters, and includes survey material on graph width theory while noting links to set theory, lattice theory and matroid theory.

Significance. If the claimed results on ultrafilters and the new parameters are both correct and distinct from existing matroid invariants, the work could supply a combinatorial unification of width parameters. The finite setting, however, confines the ultrafilter constructions to maximal filters in a finite Boolean lattice, limiting substantive transfer of infinitary topological or set-theoretic properties and reducing the claimed broadening of graph-structure study to a re-framing exercise.

major comments (2)
  1. [Abstract] Abstract (and opening paragraphs): the explicit restriction to finite X implies that 2^X is a finite Boolean algebra and ultrafilters exist by elementary maximality with no appeal to AC or non-principal examples; this directly undercuts the framing that ultrafilters retain their 'fundamental role in topology and set theory' in a way that yields new graph-width insights.
  2. [Parameter-development sections] Sections developing the width-, length- and depth-type parameters: without an explicit comparison (e.g., a table or proposition) showing that the new invariants are not equivalent to known submodular-function parameters already studied in matroid theory, the central claim that the connectivity-system framework 'broadens the perspective' remains unverified.
minor comments (2)
  1. [Title] The repeated use of 'Various' in the title is informal; a more precise title would better suit journal publication.
  2. [Preliminaries] Notation for connectivity systems (X,f) and the symmetry/submodularity conditions on f should be stated once in a dedicated preliminary section rather than repeated inline.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address the major comments point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract (and opening paragraphs): the explicit restriction to finite X implies that 2^X is a finite Boolean algebra and ultrafilters exist by elementary maximality with no appeal to AC or non-principal examples; this directly undercuts the framing that ultrafilters retain their 'fundamental role in topology and set theory' in a way that yields new graph-width insights.

    Authors: We agree that the finite restriction means ultrafilters arise by elementary maximality in a finite Boolean algebra without AC or non-principal examples. The manuscript's phrasing draws an analogy to the broader role of ultrafilters to motivate the combinatorial study, but does not claim direct transfer of infinitary topological or set-theoretic results. We will revise the abstract and opening paragraphs to clarify the finite setting and focus the motivation on lattice-theoretic and matroid-theoretic unification within graph width parameters. revision: partial

  2. Referee: [Parameter-development sections] Sections developing the width-, length- and depth-type parameters: without an explicit comparison (e.g., a table or proposition) showing that the new invariants are not equivalent to known submodular-function parameters already studied in matroid theory, the central claim that the connectivity-system framework 'broadens the perspective' remains unverified.

    Authors: We accept that an explicit comparison is needed to verify the claim of broadening the perspective. We will add a table (or proposition) in the parameter-development sections that systematically compares the new width-, length-, and depth-type parameters against known submodular-function invariants in matroid theory, indicating relations or distinctions. revision: yes

Circularity Check

0 steps flagged

No circularity; survey-style development of new notions on finite connectivity systems without load-bearing self-reductions

full rationale

The paper introduces ultrafilters, prefilters, and related width parameters on finite connectivity systems (X,f) with f symmetric submodular, framing them as extensions of classical concepts to graph theory. No equations, derivations, or self-citations are exhibited that reduce claimed results to inputs by construction (e.g., no fitted parameters renamed as predictions, no uniqueness theorems imported from the author's prior work, and no ansatzes smuggled via citation). The finite-X restriction makes the setting purely combinatorial, but the text presents this as a broadening rather than a re-labeling of existing invariants; the central claims remain independent of any self-referential loop.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no concrete free parameters, axioms, or invented entities can be extracted from the text.

pith-pipeline@v0.9.0 · 5758 in / 1119 out tokens · 21887 ms · 2026-05-23T22:12:16.531477+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

300 extracted references · 300 canonical work pages · 2 internal anchors

  1. [1]

    European Journal of Operational Research , 229(2):444--452, 2013

    Cooperative game theory approach to allocating benefits of horizontal cooperation. European Journal of Operational Research , 229(2):444--452, 2013

    work page 2013

  2. [2]

    Faq: questions asked frequently

    Mahmoud Abo Khamis, Hung Q Ngo, and Atri Rudra. Faq: questions asked frequently. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , pages 13--28, 2016

    work page 2016

  3. [3]

    Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs

    Ittai Abraham et al. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing , 2014

    work page 2014

  4. [4]

    Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs

    Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages 79--88, 2014

    work page 2014

  5. [5]

    Abu-Khzam et al

    Faisal N. Abu-Khzam et al. Modular-width: An auxiliary parameter for parameterized parallel complexity. In Frontiers in Algorithmics: 11th International Workshop, FAW 2017 , volume 11 of Proceedings , Chengdu, China, 2017. Springer International Publishing

    work page 2017

  6. [6]

    Adamson and Iain T

    Iain T. Adamson and Iain T. Adamson. Equivalents of the Axiom of Choice . A Set Theory Workbook, 1998

    work page 1998

  7. [7]

    Ordered direct implicational basis of a finite closure system

    Kira Adaricheva, James B Nation, and Robert Rand. Ordered direct implicational basis of a finite closure system. Discrete Applied Mathematics , 161(6):707--723, 2013

    work page 2013

  8. [8]

    Tree-like structure in large social and information networks

    Aaron B Adcock, Blair D Sullivan, and Michael W Mahoney. Tree-like structure in large social and information networks. In 2013 IEEE 13th international conference on data mining , pages 1--10. IEEE, 2013

    work page 2013

  9. [9]

    Adler, B.M

    I. Adler, B.M. Bui-Xuan, Y. Rabinovich, G. Renault, J.A. Telle, and M. Vatshelle. On the boolean-width of a graph: Structure and applications. In Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science , pages 159--170, Zarós, Greece

    work page

  10. [10]

    Marshals, monotone marshals, and hypertree-width

    Isolde Adler. Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory , 47(4):275--296, 2004

    work page 2004

  11. [11]

    Directed tree-width examples

    Isolde Adler. Directed tree-width examples. Journal of Combinatorial Theory, Series B , 97(5):718--725, 2007

    work page 2007

  12. [12]

    Tree-width and functional dependencies in databases

    Isolde Adler. Tree-width and functional dependencies in databases. In Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , pages 311--320, 2008

    work page 2008

  13. [13]

    Games for width parameters and monotonicity

    Isolde Adler. Games for width parameters and monotonicity. arXiv preprint arXiv:0906.3857 , 2009

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  14. [14]

    Hypertree-depth and minors in hypergraphs

    Isolde Adler, Tom \'a s Gaven c iak, and Tereza Klimo s ov \'a . Hypertree-depth and minors in hypergraphs. Theoretical Computer Science , 463:84--95, 2012

    work page 2012

  15. [15]

    Hypertree width and related hypergraph invariants

    Isolde Adler, Georg Gottlob, and Martin Grohe. Hypertree width and related hypergraph invariants. European Journal of Combinatorics , 28(8):2167--2181, 2007

    work page 2007

  16. [16]

    Linear rank-width and linear clique-width of trees

    Isolde Adler and Mamadou Moustapha Kanté. Linear rank-width and linear clique-width of trees. Theoretical Computer Science , 589:87--98, 2015

    work page 2015

  17. [17]

    Connected search for a lazy robber

    Isolde Adler, Christophe Paul, and Dimitrios M Thilikos. Connected search for a lazy robber. Journal of Graph Theory , 97(4):510--552, 2021

    work page 2021

  18. [18]

    Spanning forests of a digraph and their applications

    Rafig Pashaevich Agaev and P Yu Chebotarev. Spanning forests of a digraph and their applications. Automation and Remote Control , 62:443--466, 2001

    work page 2001

  19. [19]

    Well-filtered algebras

    Istv \'a n \'A goston, Vlastimil Dlab, and Erzs \'e bet Luk \'a cs. Well-filtered algebras. Journal of Pure and Applied Algebra , 133(1-2):3--21, 1998

    work page 1998

  20. [20]

    Simultaneous feedback edge set: A parameterized perspective

    Akanksha Agrawal, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. Simultaneous feedback edge set: A parameterized perspective. Algorithmica , 83:753 -- 774, 2016

    work page 2016

  21. [21]

    Aiswarya, Paul Gastin, and K

    C. Aiswarya, Paul Gastin, and K. Narayan Kumar. Verifying communicating multipushdown systems via split-width. In Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014 , volume 8837 of Lecture Notes in Computer Science , pages 1--17. Springer, 2014

    work page 2014

  22. [22]

    Verifying communicating multi-pushdown systems via split-width

    Cyriac Aiswarya, Paul Gastin, and K Narayan Kumar. Verifying communicating multi-pushdown systems via split-width. In Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings 12 , pages 1--17. Springer, 2014

    work page 2014

  23. [23]

    Edge-bandwidth of the triangular grid

    Reza Akhtar, Tao Jiang, and Dan Pritikin. Edge-bandwidth of the triangular grid. the electronic journal of combinatorics , 14(1):R67, 2007

    work page 2007

  24. [24]

    Bipolar fuzzy graphs

    Muhammad Akram. Bipolar fuzzy graphs. Information sciences , 181(24):5548--5564, 2011

    work page 2011

  25. [25]

    Single-valued neutrosophic graphs

    Muhammad Akram. Single-valued neutrosophic graphs . Springer, 2018

    work page 2018

  26. [26]

    Intuitionistic fuzzy cycles and intuitionistic fuzzy trees

    Muhammad Akram and Noura Omair Alshehri. Intuitionistic fuzzy cycles and intuitionistic fuzzy trees. The Scientific World Journal , 2014(1):305836, 2014

    work page 2014

  27. [27]

    Pythagorean dombi fuzzy graphs

    Muhammad Akram, Jawaria Mohsan Dar, and Sumera Naz. Pythagorean dombi fuzzy graphs. Complex & Intelligent Systems , 6:29--54, 2020

    work page 2020

  28. [28]

    Bipolar fuzzy trees

    Muhammad Akram and Adeel Farooq. Bipolar fuzzy trees. New trends in mathematical sciences , 4(3):58--72, 2016

    work page 2016

  29. [29]

    Certain types of vague graphs

    Muhammad Akram, Feng Feng, Shahzad Sarwar, and Youne Bae Jun. Certain types of vague graphs. University Politehnica of Bucharest Scientific Bulletin Series A , 76(1):141--154, 2014

    work page 2014

  30. [30]

    Complex pythagorean dombi fuzzy graphs for decision making

    Muhammad Akram and Ayesha Khan. Complex pythagorean dombi fuzzy graphs for decision making. Granular Computing , 6:645--669, 2021

    work page 2021

  31. [31]

    Certain concepts of bipolar fuzzy directed hypergraphs

    Muhammad Akram and Anam Luqman. Certain concepts of bipolar fuzzy directed hypergraphs. Mathematics , 5(1):17, 2017

    work page 2017

  32. [32]

    Intuitionistic single-valued neutrosophic hypergraphs

    Muhammad Akram and Anam Luqman. Intuitionistic single-valued neutrosophic hypergraphs. Opsearch , 54:799--815, 2017

    work page 2017

  33. [33]

    Fuzzy hypergraphs

    Muhammad Akram and Anam Luqman. Fuzzy hypergraphs. In Fuzzy Hypergraphs and Related Extensions , pages 1--75. Springer, 2020

    work page 2020

  34. [34]

    Hypergraphs for interval-valued structures

    Muhammad Akram and Anam Luqman. Hypergraphs for interval-valued structures. In Fuzzy Hypergraphs and Related Extensions , pages 125--154. Springer, 2020

    work page 2020

  35. [35]

    Bipolar fuzzy (directed) hypergraphs

    Muhammad Akram, Anam Luqman, Muhammad Akram, and Anam Luqman. Bipolar fuzzy (directed) hypergraphs. Fuzzy Hypergraphs and Related Extensions , pages 155--186, 2020

    work page 2020

  36. [36]

    Extended bipolar fuzzy (directed) hypergraphs to m-polar information

    Muhammad Akram, Anam Luqman, Muhammad Akram, and Anam Luqman. Extended bipolar fuzzy (directed) hypergraphs to m-polar information. Fuzzy Hypergraphs and Related Extensions , pages 187--234, 2020

    work page 2020

  37. [37]

    Some types of hypergraphs for single-valued neutrosophic structures

    Muhammad Akram, Anam Luqman, Muhammad Akram, and Anam Luqman. Some types of hypergraphs for single-valued neutrosophic structures. Fuzzy Hypergraphs and Related Extensions , pages 365--441, 2020

    work page 2020

  38. [38]

    Implementation of single-valued neutrosophic soft hypergraphs on human nervous system

    Muhammad Akram and Hafiza Saba Nawaz. Implementation of single-valued neutrosophic soft hypergraphs on human nervous system. Artificial Intelligence Review , 56(2):1387--1425, 2023

    work page 2023

  39. [39]

    Graphs for the analysis of bipolar fuzzy information , volume 401

    Muhammad Akram, Musavarah Sarwar, and Wieslaw A Dudek. Graphs for the analysis of bipolar fuzzy information , volume 401. Springer, 2021

    work page 2021

  40. [40]

    Bipolar neutrosophic graph structures

    Muhammad Akram, Musavarah Sarwar, Wieslaw A Dudek, Muhammad Akram, Musavarah Sarwar, and Wieslaw A Dudek. Bipolar neutrosophic graph structures. Graphs for the Analysis of Bipolar Fuzzy Information , pages 393--446, 2021

    work page 2021

  41. [41]

    Operations on single-valued neutrosophic graphs

    Muhammad Akram and Gulfam Shahzadi. Operations on single-valued neutrosophic graphs . Infinite Study, 2017

    work page 2017

  42. [42]

    Decision-making approach based on pythagorean dombi fuzzy soft graphs

    Muhammad Akram and Gulfam Shahzadi. Decision-making approach based on pythagorean dombi fuzzy soft graphs. Granular computing , 6:671--689, 2021

    work page 2021

  43. [43]

    Novel applications of single-valued neutrosophic graph structures in decision-making

    Muhammad Akram and Muzzamal Sitara. Novel applications of single-valued neutrosophic graph structures in decision-making. Journal of Applied Mathematics and Computing , 56:501--532, 2018

    work page 2018

  44. [44]

    Inverse domination in bipolar fuzzy graphs

    Saqr H AL-Emrany and Mahioub MQ Shubatah. Inverse domination in bipolar fuzzy graphs. Annals of Fuzzy Mathematics and Informatics , 20(1):67--77, 2020

    work page 2020

  45. [45]

    arXiv:2302.01808v1

    Sandra Albrechtsen. Refining trees of tangles in abstract separation systems i: Inessential parts. arXiv preprint arXiv:2302.01808 , 2023

    work page arXiv 2023

  46. [46]

    Tangle-tree duality in infinite graphs

    Sandra Albrechtsen. Tangle-tree duality in infinite graphs. arXiv preprint arXiv:2405.06756 , 2024

    work page arXiv 2024

  47. [47]

    A structural duality for path-decompositions into parts of small radius

    Sandra Albrechtsen, Reinhard Diestel, Ann-Kathrin Elm, Eva Fluck, Raphael W Jacobs, Paul Knappe, and Paul Wollan. A structural duality for path-decompositions into parts of small radius. arXiv preprint arXiv:2307.08497 , 2023

    work page arXiv 2023

  48. [48]

    Correspondence and completeness for generalized quantifiers

    Natasha Alechina and Michiel van Lambalgen. Correspondence and completeness for generalized quantifiers. 1994

    work page 1994

  49. [49]

    Graph functionality

    Bogdan Alecu, Aistis Atminas, and Vadim Lozin. Graph functionality. Journal of Combinatorial Theory, Series B , 147:139--158, 2021

    work page 2021

  50. [50]

    The position value for union stable systems

    E Algaba, Jes \'u s Mario Bilbao, Peter Borm, and JJ L \'o pez. The position value for union stable systems. Mathematical Methods of Operations Research , 52:221--236, 2000

    work page 2000

  51. [51]

    An axiomatization of the banzhaf value for cooperative games on antimatroids

    E Algaba, Jes \'u s Mario Bilbao, R van den Brink, and Andr \'e s Jim \'e nez-Losada. An axiomatization of the banzhaf value for cooperative games on antimatroids. Mathematical Methods of Operations Research , 59:147--166, 2004

    work page 2004

  52. [52]

    Harsanyi power solutions for games on union stable systems

    E Algaba, Jes \'u s Mario Bilbao, and Ren \'e van den Brink. Harsanyi power solutions for games on union stable systems. Annals of Operations Research , 225:27--44, 2015

    work page 2015

  53. [53]

    Axiomatizations of the shapley value for cooperative games on antimatroids

    E Algaba, Jes \'u s Mario Bilbao, Rene van den Brink, and Andr \'e s Jim \'e nez-Losada. Axiomatizations of the shapley value for cooperative games on antimatroids. Mathematical Methods of Operations Research , 57(1):49--65, 2003

    work page 2003

  54. [54]

    Cooperative games on accessible union stable systems

    Encarnaci \'o n Algaba, Ren \'e van den Brink, and Chris Dietz. Cooperative games on accessible union stable systems. 2013

    work page 2013

  55. [55]

    Complex neutrosophic set

    Mumtaz Ali and Florentin Smarandache. Complex neutrosophic set. Neural computing and applications , 28:1817--1834, 2017

    work page 2017

  56. [56]

    Neutrosophic vague set theory

    Shawkat Alkhazaleh. Neutrosophic vague set theory. Critical Review , 10:29--39, 2015

    work page 2015

  57. [57]

    Dynamic parameterized problems and algorithms

    Josh Alman, Matthias Mnich, and Virginia Vassilevska Williams. Dynamic parameterized problems and algorithms. ACM Trans. Algorithms , 16(4):45:1--45:46, 2020

    work page 2020

  58. [58]

    On coverage in multi-interface networks with bounded pathwidth

    Alessandro Aloisio and Alfredo Navarra. On coverage in multi-interface networks with bounded pathwidth. In International Conference on Advanced Information Networking and Applications , pages 96--105. Springer, 2024

    work page 2024

  59. [59]

    Parameterized complexity of coverage in multi-interface iot networks: Pathwidth

    Alessandro Aloisio and Alfredo Navarra. Parameterized complexity of coverage in multi-interface iot networks: Pathwidth. Internet of Things , page 101353, 2024

    work page 2024

  60. [60]

    Chasing a fast robber on planar graphs and random graphs

    Noga Alon and Abbas Mehrabian. Chasing a fast robber on planar graphs and random graphs. Journal of Graph Theory , 78(2):81--96, 2015

    work page 2015

  61. [61]

    Cycle decompositions iv: complete directed graphs and fixed length directed cycles

    Brian Alspach, Heather Gavlas, Mateja S ajna, and Helen Verrall. Cycle decompositions iv: complete directed graphs and fixed length directed cycles. Journal of Combinatorial Theory, Series A , 103(1):165--208, 2003

    work page 2003

  62. [62]

    An analysis of one approximation algorithm for graph linearization

    Asaad Althoubi. An analysis of one approximation algorithm for graph linearization. 2017

    work page 2017

  63. [63]

    Balanced picture fuzzy graph with application

    Sk Amanathulla, Biswajit Bera, and Madhumangal Pal. Balanced picture fuzzy graph with application. Artificial Intelligence Review , 54(7):5255--5281, 2021

    work page 2021

  64. [64]

    An introduction to picture fuzzy graph and its application to select best routes in an airlines network

    Sk Amanathulla and Madhumangal Pal. An introduction to picture fuzzy graph and its application to select best routes in an airlines network. In Handbook of Research on Advances and Applications of Fuzzy Sets and Logic , pages 385--411. IGI Global, 2022

    work page 2022

  65. [65]

    Submodular partition functions

    Omid Amini et al. Submodular partition functions. Discrete Mathematics , 309(20):6000--6008, 2009

    work page 2009

  66. [66]

    On the path-width of planar graphs

    Omid Amini, Florian Huc, and St \'e phane P \'e rennes. On the path-width of planar graphs. SIAM Journal on Discrete Mathematics , 23(3):1311--1316, 2009

    work page 2009

  67. [67]

    A spectral lower bound for the divisorial gonality of metric graphs

    Omid Amini and Janne Kool. A spectral lower bound for the divisorial gonality of metric graphs. International Mathematics Research Notices , 2016(8):2423--2450, 2016

    work page 2016

  68. [68]

    Submodular partition functions

    Omid Amini, Fr \'e d \'e ric Mazoit, Nicolas Nisse, and St \'e phan Thomass \'e . Submodular partition functions. Discrete Mathematics , 309(20):6000--6008, 2009

    work page 2009

  69. [69]

    Amiri, L

    S.A. Amiri, L. Kaiser, S. Kreutzer, R. Rabinovich, and S. Siebertz. Graph searching games and width measures for directed graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS) , Leibniz International Proceedings in Informatics (LIPIcs), pages 34--47. Schloss Dagstuhl Leibniz-Zentrum fuer Informatik, 2015

    work page 2015

  70. [70]

    Sparse outerstring graphs have logarithmic treewidth

    Shinwoo An, Eunjin Oh, and Jie Xue. Sparse outerstring graphs have logarithmic treewidth. arXiv preprint arXiv:2406.17424 , 2024

    work page arXiv 2024

  71. [71]

    Combinatorics of finite sets

    Ian Anderson. Combinatorics of finite sets . Courier Corporation, 2002

    work page 2002

  72. [72]

    A characterization of bisubmodular functions

    Kazutoshi Ando, Satoru Fujishige, and Takeshi Naitoh. A characterization of bisubmodular functions. Discret. Math. , 148:299--303, 1996

    work page 1996

  73. [73]

    A survey on hypergraph representation learning

    Alessia Antelmi, Gennaro Cordasco, Mirko Polato, Vittorio Scarano, Carmine Spagnuolo, and Dingqi Yang. A survey on hypergraph representation learning. ACM Computing Surveys , 56(1):1--38, 2023

    work page 2023

  74. [74]

    Algorithms for computing network coding rate regions via single element extensions of matroids

    Jayant Apte, Congduan Li, and John MacLaren Walsh. Algorithms for computing network coding rate regions via single element extensions of matroids. In 2014 IEEE International Symposium on Information Theory . IEEE, 2014

    work page 2014

  75. [75]

    The basic concepts and constructions of general topology

    AV Arkhangel’skiǐ and Vitaly V Fedorchuk. The basic concepts and constructions of general topology. In General Topology I: Basic Concepts and Constructions Dimension Theory , pages 1--90. Springer, 1990

    work page 1990

  76. [76]

    Arnborg, J

    S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms , 12:308--340, 1991

    work page 1991

  77. [77]

    The algorithmic complexity of tree-clique width

    Chris Aronis. The algorithmic complexity of tree-clique width. arXiv preprint arXiv:2111.02200 , 2021

    work page arXiv 2021

  78. [78]

    Computational complexity: a modern approach

    Sanjeev Arora and Boaz Barak. Computational complexity: a modern approach . Cambridge University Press, 2009

    work page 2009

  79. [79]

    Parameterized compilability

    Noel Arteche Echeverr \' a. Parameterized compilability. 2022

    work page 2022

  80. [80]

    The restricted arc-width of a graph

    David Arthur. The restricted arc-width of a graph. The Electronic Journal of Combinatorics , 2003. R41

    work page 2003

Showing first 80 references.