Pages that link to "Item:Q2334869"
From MaRDI portal
The following pages link to Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869):
Displaying 44 items.
- Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
- Signed graphs with maximal index (Q2032887) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Sensitivities and block sensitivities of elementary symmetric Boolean functions (Q2048184) (← links)
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
- The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras (Q2098195) (← links)
- Eigenvalues and critical groups of Adinkras (Q2104909) (← links)
- On separation between the degree of a Boolean function and the block sensitivity (Q2117108) (← links)
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space (Q2124620) (← links)
- Conflict complexity is lower bounded by block sensitivity (Q2219069) (← links)
- Graph covers with two new eigenvalues (Q2225463) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- On sensitivity in bipartite Cayley graphs (Q2668018) (← links)
- Critical groups of strongly regular graphs and their generalizations (Q2683410) (← links)
- Collectively canalizing Boolean functions (Q2687272) (← links)
- On the central levels problem (Q2692785) (← links)
- Counterexamples to “A conjecture on induced subgraphs of Cayley graphs” (Q4993946) (← links)
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (Q5034136) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- Induced subgraphs of powers of oriented cycles (Q5049192) (← links)
- Interview with Yufei Zhao (Q5056214) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5089234) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- Open problems in the spectral theory of signed graphs (Q5198026) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Some regular signed graphs with only two distinct eigenvalues (Q5862371) (← links)
- A decomposition of signed graphs with two eigenvalues (Q5865269) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- Tight bounds on sensitivity and block sensitivity of some classes of transitive functions (Q5925611) (← links)
- On induced subgraphs of the Hamming graph (Q6055388) (← links)
- Induced subgraphs of product graphs and a generalization of Huang's theorem (Q6056784) (← links)
- An induced subgraph of the Hamming graph with maximum degree 1 (Q6081592) (← links)
- There is no going back: properties of the non-backtracking Laplacian (Q6087882) (← links)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← links)
- Complete signed graphs with largest maximum or smallest minimum eigenvalue (Q6117351) (← links)
- Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum (Q6146191) (← links)
- Nodal domain theorems for \(p\)-Laplacians on signed graphs (Q6146940) (← links)
- The index of signed graphs with forbidden subgraphs (Q6166495) (← links)
- Extremal results for \(C_3^-\)-free signed graphs (Q6184913) (← links)
- NEPS of complex unit gain graphs (Q6202070) (← links)
