vix.ing · top · new · best · stats · spec
  1. On forest and bipartite cuts in sparse graphs
    2025/05/22 by Ilya I. Bogdanov, Bogdanov, Ilya I., Elizaveta Andreevna Neustroeva +8 · 4 citations
    Computer Science · Mathematics · #05C35 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory
  2. Polynomial Bounds for the Graph Minor Structure Theorem
    2025/04/03 by Gorsky, Maximilian, Seweryn, Michał T., Wiederrecht, Sebastian · 4 citations
    #05C10 #05C40 #05C75 #05C83 #05C85 #68R05 #68R10 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
  3. The minimum size of a 3-connected locally nonforesty graph
    2024/10/31 by Chengli Li, Yurui Tang, Li, Chengli +3 · 1 citation
    Computer Science · Mathematics · #05C35 #05C38 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems
  4. Merge Trees of Periodic Filtrations
    2024/08/29 by Edelsbrunner, Herbert, Heiss, Teresa · 1 citation
    #05C05 #05C38 #05C40 #05C63 #05C85 #05C90 #05C92 #52C22 #55-08 #55N31 (Primary) #68W05 #92E10 (Secondary) #Algebraic Topology (math.AT) #Combinatorics (math.CO) #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #G.2.3 #Metric Geometry (math.MG)
  5. A 5/4-Approximation for Two-Edge Connectivity
    2024/08/13 by Bosch-Calvo, Miguel, Garg, Mohit, Grandoni, Fabrizio +3 · 2 citations
    #05C40 #05C85 (Secondary) #68R10 #68W25 (Primary) 68W40 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics
  6. On spectrally optimal duals of frames generated by graphs
    2024/06/02 by Deepshikha, Samanta, Aniruddha · 3 citations
    #05C40 #05C50 #42C15 #42C40 #46C05 #Combinatorics (math.CO) #FOS: Mathematics #Functional Analysis (math.FA)
  7. Connectoids I: a universal end space theory
    2024/05/23 by Bowler, Nathan, Reich, Florian · 2 citations
    #05C40 #05C63 #Combinatorics (math.CO) #FOS: Mathematics
  8. Counterexamples regarding linked and lean tree-decompositions of infinite graphs
    2024/05/10 by Albrechtsen, Sandra, Jacobs, Raphael W., Knappe, Paul +1 · 2 citations
    #05C05 #05C40 #05C63 #05C83 #Combinatorics (math.CO) #FOS: Mathematics
  9. Linked tree-decompositions into finite parts
    2024/05/10 by Albrechtsen, Sandra, Jacobs, Raphael W., Knappe, Paul +1 · 1 citation
    #05C05 #05C40 #05C63 #05C83 #Combinatorics (math.CO) #FOS: Mathematics
  10. Properties of graphs of neural codes
    2024/03/26 by K N Suhith, Gupta Neha, N, Suhith K +1 · 1 citation
    Computer Science · Mathematics · #05C40 #05C99 #52A37 #92B99 #Advanced Graph Neural Networks #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Topological and Geometric Data Analysis
  11. Tree decompositions meet induced matchings: beyond Max Weight Independent Set
    2024/02/24 by Lima, Paloma T., Milanič, Martin, Muršič, Peter +3 · 6 citations
    #05C05 #05C12 #05C15 #05C38 #05C40 #05C70 #05C75 #05C76 #05C83 (Secondary) #05C85 (Primary) #68Q25 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  12. Induced Minor Models. I. Structural Properties and Algorithmic Consequences
    2024/02/13 by Bousquet, Nicolas, Dallard, Clément, Dumas, Maël +4 · 1 citation
    #05C40 #05C69 (Secondary) #05C75 (Primary) #05C83 #05C85 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  13. Classification and Construction of Planar, 3-Connected Kronecker Products
    2024/02/02 by Riccardo W. Maffucci, Maffucci, Riccardo W. · 1 citation
    Computer Science · Mathematics · #05C10 #05C40 #05C62 #05C75 #05C76 #05C83 #05C85 #52B05 #52B10 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Mathematics and Applications #Polynomial and algebraic computation
  14. Rigid partitions: from high connectivity to random graphs
    2023/11/24 by Krivelevich, Michael, Lew, Alan, Michaeli, Peleg · 3 citations
    #05C10 #05C40 #05C50 #05C80 #52C25 #Combinatorics (math.CO) #FOS: Mathematics
  15. The maximum number of connected sets in regular graphs
    2023/10/31 by Cambie, Stijn, Goedgebeur, Jan, Jooken, Jorik · 1 citation
    #05C07 #05C35 #05C40 #05C48 #05C50 #05C69 #05C85 #68R05 #68R10 #Combinatorics (math.CO) #FOS: Mathematics
  16. The generalized 4-connectivity of burnt pancake graphs
    2023/10/02 by Wang, Jing, Wu, Jiang, Ouyang, Zhangdong +1 · 1 citation
    #05C05 #05C40 #Combinatorics (math.CO) #FOS: Mathematics
  17. On an induced version of Menger's theorem
    2023/09/14 by Hendrey, Kevin, Norin, Sergey, Steiner, Raphael +1 · 7 citations
    #05C38 (Primary) 05C15 #05C40 #05C83 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics
  18. Decreasing the mean subtree order by adding k edges
    2023/08/24 by Stijn Cambie, Cambie, Stijn, Guantao Chen +5 · 1 citation
    Computer Science · Mathematics · #05C05 #05C35 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems
  19. Menger's Theorem in bidirected graphs
    2023/06/02 by Bowler, Nathan, Ghorbani, Ebrahim, Gut, Florian +2 · 2 citations
    #05C20 #05C38 #05C40 #Combinatorics (math.CO) #FOS: Mathematics
  20. A grid theorem for strong immersions of walls
    2023/01/12 by Diestel, Reinhard, Jacobs, Raphael W., Knappe, Paul +1 · 1 citation
    #05C40 #05C75 #05C83 #Combinatorics (math.CO) #FOS: Mathematics
  21. Numerical homogenization of spatial network models
    2022/09/13 by Edelvik, Fredrik, Görtz, Morgan, Hellman, Fredrik +2 · 1 citation
    #05C40 #05C50 #34B45 #FOS: Mathematics #Numerical Analysis (math.NA)
  22. Connectedness and Cycle Spaces of Friends-and-Strangers Graphs
    2022/09/04 by Colin Defant, David Dong, Defant, Colin +5 · 1 citation
    Computer Science · Mathematics · #05C40 #05C70 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Rings, Modules, and Algebras
  23. Canonical graph decompositions via coverings
    2022/07/11 by Reinhard Diestel, Diestel, Reinhard, Raphael W. Jacobs +5 · 3 citations
    Engineering · Mathematics · #05C25 #05C38 #05C40 #05C63 #05C83 #57M15 #Advanced Materials and Mechanics #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR)
  24. Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
    2022/06/30 by Clément Dallard, Dallard, Clément, Martin Milanič +3 · 9 citations
    Computer Science · Mathematics · #05C05 #05C40 #05C69 #05C75 (Primary) #05C83 #05C85 #68Q25 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
  25. Monochromatic components with many edges
    2022/04/24 by David Conlon, Conlon, David, Sammy Luo +3 · 1 citation
    Computer Science · Mathematics · #05C15 #05C35 #05C40 #05C55 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
  26. Treewidth versus clique number. II. Tree-independence number
    2021/11/08 by Dallard, Clément, Milanič, Martin, Štorgel, Kenny · 12 citations
    #05C40 #05C62 (Secondary) #05C69 #05C85 (Primary) 05C05 #68Q25 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  27. On the Asymmetric Generalizations of Two Extremal Questions on Friends-and-Strangers Graphs
    2021/07/14 by Bangachev, Kiril · 1 citation
    #05C35 #05C40 #Combinatorics (math.CO) #FOS: Mathematics
  28. On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs
    2021/06/08 by Mol, Lucas, Oellermann, Ortrud R., Oswal, Vibhav · 1 citation
    #05C35 #05C40 #05C75 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  29. Fibonacci-run graphs I: basic properties
    2020/10/12 by Eğecioğlu, Ömer, Iršič, Vesna · 1 citation
    #05A15 #05C12 #05C30 #05C40 #05C75 #Combinatorics (math.CO) #FOS: Mathematics
  30. Friends and Strangers Walking on Graphs
    2020/09/10 by Defant, Colin, Kravitz, Noah · 1 citation
    #05A05 #05C38 #05C40 #Combinatorics (math.CO) #FOS: Mathematics

more