1. When are off-diagonal hypergraph Ramsey numbers polynomial?
   2024/11/21 by David Conlon, Conlon, David, Jacob Fox +13 · 2 citations
   Computer Science · Mathematics · #05D10 (Primary) #05D40 (Secondary) #Advanced Topology and Set Theory #Combinatorics #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Diagonal #Discrete mathematics #FOS: Mathematics #Geometry #Graph #Hypergraph #Limits and Structures in Graph Theory #Mathematical analysis #Mathematics #Polynomial #Ramsey's theorem
2. Lexicographical ordering of hypergraphs via spectral moment
   2023/09/29 by Hong Zhou, Zhou, Hong, Changjiang Bu +1 · 3 citations
   Computer Science · Mathematics · #Combinatorics #Combinatorics (math.CO) #Discrete mathematics #FOS: Mathematics #Hypergraph #Lexicographical order #Mathematics #Matrix Theory and Algorithms #Moment (physics) #Order (exchange) #Physics #Tensor decomposition and applications
3. Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph \boldsymbolβ-Model
   2023/07/06 by Sagnik Nandy, Bhaswar B. Bhattacharya, Nandy, Sagnik +1 · 1 citation
   Biochemistry, Genetics and Molecular Biology · Materials Science · Mathematics · Physics and Astronomy · #Applied mathematics #Asymptotic distribution #BETA (programming language) #Combinatorics #Complex Network Analysis Techniques #Computer science #Degree (music) #Discrete mathematics #Estimator #FOS: Computer and information sciences #FOS: Mathematics #Gene Regulatory Network Analysis #Graph #Hypergraph #Inference #Information Theory (cs.IT) #Lanthanide and Transition Metal Complexes #Machine Learning (stat.ML) #Mathematical optimization #Mathematics #Minimax #Pairwise comparison #Random graph #Social and Information Networks (cs.SI) #Statistics #Statistics Theory (math.ST)
4. Transversal Hamilton cycle in hypergraph systems
   2021/11/13 by Yangyang Cheng, Jie Han, Cheng, Yangyang +7 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics #Combinatorics (math.CO) #Discrete mathematics #FOS: Mathematics #Graph #Hypergraph #Limits and Structures in Graph Theory #Mathematical analysis #Mathematics #Physics #Transversal (combinatorics) #Vertex (graph theory)
5. Sparse Kneser graphs are Hamiltonian
   2020/12/10 by Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak · 1 citation
   Mathematics · Engineering · Computer Science · #Limits and Structures in Graph Theory #graph theory and CDMA systems #Topological and Geometric Data Analysis #Combinatorics #Mathematics #Hamiltonian path #Odd graph #Disjoint sets #Hypergraph #Discrete mathematics #Graph #Complete graph #Chordal graph #1-planar graph
6. Finding Perfect Matchings in Bipartite Hypergraphs
   2017/12/09 by Chidambaram Annamalai · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Bipartite graph #Blossom algorithm #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Generalization #Graph #Hypergraph #Limits and Structures in Graph Theory #Line graph #Matching (statistics) #Mathematics #Pathwidth #Strong perfect graph theorem
7. Toward a Formal Model of Cognitive Synergy
   2017/03/13 by Ben Goertzel, Goertzel, Ben · 1 citation
   Computer Science · Mathematics · Psychology · #Artificial Intelligence (cs.AI) #Artificial intelligence #Associative property #Cognition #Cognitive Computing and Networks #Cognitive Science and Mapping #Cognitive architecture #Cognitive model #Cognitive science #Computability, Logic, AI Algorithms #Computer science #FOS: Computer and information sciences #Hypergraph #Mathematics #Probabilistic logic #Psychology #Theoretical computer science #cs.AI
8. A lower bound on the hypergraph Ramsey number R(4,5;3)
   2016/07/27 by Janusz Dybizbański · 1 citation
   Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Advanced Graph Theory Research #Hypergraph #Ramsey's theorem #Combinatorics #Mathematics #Set (abstract data type) #Element (criminal law) #Upper and lower bounds #Discrete mathematics #Graph #Computer science
9. A note on induced Ramsey numbers
   2016/01/31 by David Conlon, Domingos Dellamonica Jr., Domingos Dellamonica +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Bounded function #Combinatorics #Discrete mathematics #Function (biology) #Graph #Hypergraph #Limits and Structures in Graph Theory #Mathematics #Monochromatic color #Natural number #Physics #Ramsey theory #Ramsey's theorem #math.CO
10. Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions
    2014/08/01 by Girish Varma, Varma, Girish · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #FOS: Computer and information sciences #Graph #Hypergraph #Mathematics #Omega #Physics #Soundness #Vertex (graph theory) #cs.CC
11. Polynomial-time perfect matchings in dense hypergraphs
    2013/07/31 by Peter Keevash, Fiachra Knox, Richard Mycroft · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Hypergraph #Lattice (music) #Limits and Structures in Graph Theory #Matching (statistics) #Mathematics #Perfect power #Time complexity #math.CO #msc:05C65 #msc:05C70
12. H⁺-Eigenvalues of Laplacian and Signless Laplacian Tensors
    2013/03/09 by Liqun Qi, Qi, Liqun · 2 citations
    Chemistry · Mathematics · Medicine · #Advanced NMR Techniques and Applications #Advanced Neuroimaging Techniques and Applications #Combinatorics #Eigenvalues and eigenvectors #FOS: Mathematics #Hypergraph #Laplace operator #Mathematical analysis #Mathematics #Physics #Pure mathematics #Quantum mechanics #Spectral Theory (math.SP) #Tensor (intrinsic definition) #Tensor decomposition and applications #math.SP
13. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
    2013/01/01 by Thomas Keßelheim, Thomas Kesselheim, Klaus Radke +2 · 1 citation
    Computer Science · Decision Sciences · Mathematics · #Algorithm #Auction Theory and Applications #Bipartite graph #Combinatorial auction #Combinatorial optimization #Combinatorics #Common value auction #Competitive analysis #Computer science #Cryptography and Data Security #Discrete mathematics #Graph #Hypergraph #Matching (statistics) #Mathematical optimization #Mathematics #Online algorithm #Optimization and Search Problems #Secretary problem #Submodular set function #Upper and lower bounds #Vertex (graph theory)
14. Small Ramsey Numbers
    2011/08/22 by Stanisław Radziszowski · 3 citations
    Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Advanced Topology and Set Theory #Ramsey's theorem #Mathematics #Hypergraph #Combinatorics #Graph #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Ramsey theory #Computer science
15. Computing the Vertices of Tropical Polyhedra Using Directed Hypergraphs
    2009/04/30 by Xavier Allamigeon, Stephane Gaubert, Stéphane Gaubert +2 · 1 citation
    Computer Science · Mathematics · #Characterization (materials science) #Combinatorics #Connected component #Discrete mathematics #Dual polyhedron #Formal Methods in Verification #Graph #Hypergraph #Hyperplane #Intersection (aeronautics) #Logic, programming, and type systems #Mathematics #Polyhedron #Polynomial and algebraic computation #Reachability #Representation (politics) #Vertex (graph theory) #math.CO #msc:05B35 #msc:52B55 #msc:68Q25 #msc:68U05
16. On exchangeable random variables and the statistics of large graphs and hypergraphs
    2008/01/01 by Tim Austin · 2 citations
    Computer Science · Mathematics · #Advanced Topology and Set Theory #Connection (principal bundle) #Hypergraph #Limits and Structures in Graph Theory #Order (exchange) #Probabilistic logic #Ramsey theory #Random graph #Random variable #Rotation formalisms in three dimensions #Topological and Geometric Data Analysis #math.CO #math.PR
17. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
    2007/12/13 by Andreas Björklund, Thore Husfeldt · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computational complexity theory #Discrete mathematics #Exponential function #Exponential time hypothesis #Graph #Hypergraph #Mathematics #Optimization and Search Problems #PSPACE #Partition (number theory) #Satisfiability #Time complexity #Vertex (graph theory) #Vertex cover
18. Hypergraph regularity and the multidimensional Szemerédi theorem
    2007/11/01 by William Timothy Gowers · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Graph theory and applications #Hypergraph #Limits and Structures in Graph Theory #Mathematics
19. Hardness of fully dense problems
    2007/04/18 by Nir Ailon, Noga Alon · 3 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Hypergraph #Mathematics #Optimization and Search Problems #Rank (graph theory) #Set (abstract data type) #Work (physics)
20. ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE
    2007/01/18 by David Romero, Abdón S ́nchez-Arroyo · 1 citation
    Computer Science · Engineering · Mathematics · #Graph Labeling and Dimension Problems #Advanced Graph Theory Research #graph theory and CDMA systems #Conjecture #Combinatorics #Hypergraph #Vertex (graph theory) #Mathematics #Generality #Discrete mathematics #Graph
21. Finding and counting cliques and independent sets in r-uniform hypergraphs
    2006/05/27 by Raphael Yuster · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Clique #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Hypergraph #Limits and Structures in Graph Theory #Mathematics #Monochromatic color #Vertex (graph theory)
22. Linear degree extractors and the inapproximability of max clique and chromatic number
    2006/05/21 by David Zuckerman · 3 citations
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Computational Geometry and Mesh Generation #Randomness #Combinatorics #Mathematics #Clique #Constant (computer programming) #Entropy (arrow of time) #Binary logarithm #Time complexity #Discrete mathematics #Hypergraph #Degree (music) #Randomized algorithm #Chromatic scale #Computer science #Statistics #Physics
23. The counting lemma for regulark‐uniform hypergraphs
    2006/01/18 by Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 3 citations
    Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Graph theory and applications #Lemma (botany) #Hypergraph #Combinatorics #Mathematics #Mathematical proof #Graph #Discrete mathematics
24. A variant of the hypergraph removal lemma
    2006/01/11 by Terence Tao · 3 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics #Discrete mathematics #Ergodic theory #Gaussian #Hypergraph #Lemma (botany) #Limits and Structures in Graph Theory #Mathematics #Number theory #Physics #Preprint #Pure mathematics
25. Szemer'edi's regularity lemma revisited
    2005/04/22 by Terence Tao · 1 citation
    Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Lemma (botany) #Iterated function #Mathematics #Combinatorics #Graph theory #Discrete mathematics #Graph #Hypergraph #Extremal graph theory #Line graph #Voltage graph
26. Regularity Lemma for k‐uniform hypergraphs
    2004/06/09 by Vojtěch Rödl, Jozef Skokan · 6 citations
    Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Lemma (botany) #Randomness #Mathematics #Combinatorics #Generalization #Discrete mathematics #Hypergraph #Random graph #Set (abstract data type) #Graph #Computer science
27. A fractional version of the Erdős-Faber-Lovász conjecture
    1992/06/01 by Jeff Kahn, Paul Seymour, P. D. Seymour · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Discrete mathematics #Generalization #Graph #Graph theory and applications #Hypergraph #Limits and Structures in Graph Theory #Mathematical analysis #Mathematics #Vertex (graph theory)
28. Coloring nearly-disjoint hypergraphs with n + o(n) colors
    1992/01/01 by Jeff Kahn · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Computer science #Conjecture #Discrete mathematics #Disjoint sets #Edge coloring #Graph #Graph Labeling and Dimension Problems #Graph power #Hypergraph #Index (typography) #Limits and Structures in Graph Theory #Line graph #Mathematics
29. An algorithmic approach to the Lovász local lemma. I
    1991/12/01 by József Beck · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems #Lemma (botany) #Hypergraph #Exponent #Mathematics #Sieve (category theory) #Constant (computer programming) #Monochromatic color #Discrete mathematics #Polynomial #Combinatorics #Time complexity #Computer science #Mathematical analysis #Physics
30. Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász
    1988/09/01 by W. I. Chang, Wonil Chang, Eugene L. Lawler +1 · 2 citations
    Computer Science · Engineering · Mathematics · #Colored #Combinatorics #Computer science #Conjecture #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Graph #Graph Labeling and Dimension Problems #Hypergraph #Limits and Structures in Graph Theory #Mathematics #Simple (philosophy) #Simple graph #Vertex (graph theory) #graph theory and CDMA systems

more