A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
Fuente:
arXiv
Saved in:
| Main Author: | Ihringer, Ferdinand |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)
by: Ihringer, Ferdinand
Published: (2023)
VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
by: Chang, Fan, et al.
Published: (2025)
by: Chang, Fan, et al.
Published: (2025)
Boolean Functions with Small Approximate Spectral Norm
by: Cheung, Tsun-Ming, et al.
Published: (2024)
by: Cheung, Tsun-Ming, et al.
Published: (2024)
String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)
by: Chudnovsky, Maria, et al.
Published: (2025)
Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)
by: Gahlawat, Harmender
Published: (2025)
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
by: Brause, Christoph, et al.
Published: (2022)
by: Brause, Christoph, et al.
Published: (2022)
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)
by: Gerke, Stefanie, et al.
Published: (2024)
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)
by: D'Elia, Marco, et al.
Published: (2024)
Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)
by: Bridoux, Florian, et al.
Published: (2024)
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)
by: Sanghi, Aryan, et al.
Published: (2026)
Strong modules and asynchronous attractors of Boolean networks
by: Ruet, Paul
Published: (2026)
by: Ruet, Paul
Published: (2026)
Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)
by: Gutin, Gregory, et al.
Published: (2025)
Block Designs and K-Geodetic Graphs: A Survey
by: Frasser, Carlos E.
Published: (2025)
by: Frasser, Carlos E.
Published: (2025)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)
by: Dumitrescu, Adrian, et al.
Published: (2024)
Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)
by: Eze, L. C., et al.
Published: (2025)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)
by: Dvořák, Pavel, et al.
Published: (2023)
On Sets of Monochromatic Objects in Bicolored Point Sets
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
A Survey on Ordered Ramsey Numbers
by: Balko, Martin
Published: (2025)
by: Balko, Martin
Published: (2025)
Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
On the number of non-degenerate canalizing Boolean functions
by: Kadelka, Claus
Published: (2025)
by: Kadelka, Claus
Published: (2025)
A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)
by: Frasser, Carlos E.
Published: (2026)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)
by: Jäger, Gerold, et al.
Published: (2019)
Free Sets in Planar Graphs: History and Applications
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)
by: Bousquet, Nicolas
Published: (2024)
Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
by: Chen, Yeyuan
Published: (2024)
by: Chen, Yeyuan
Published: (2024)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)
by: Spirkl, Sophie, et al.
Published: (2026)
Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
Graph Theory
by: Gilbert, Jesse D.
Published: (2011)
by: Gilbert, Jesse D.
Published: (2011)
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)
by: Bhyravarapu, Sriram, et al.
Published: (2021)
Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)
by: Arras, Patrick, et al.
Published: (2024)
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
by: Hatzel, Meike, et al.
Published: (2026)
by: Hatzel, Meike, et al.
Published: (2026)
Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
On Threshold Compatibility Graphs
by: Hakim, Sheikh Azizul, et al.
Published: (2026)
by: Hakim, Sheikh Azizul, et al.
Published: (2026)
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)
by: Büngener, Aaron
Published: (2025)
Similar Items
-
The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023) -
VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
by: Chang, Fan, et al.
Published: (2025) -
Boolean Functions with Small Approximate Spectral Norm
by: Cheung, Tsun-Ming, et al.
Published: (2024) -
String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025) -
Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)