The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry (Q1113453) (← links)
- Bounding one-way differences (Q1114687) (← links)
- Hadamard graphs. II (Q1114709) (← links)
- Orthogonal resolutions in odd balanced tournament designs (Q1115446) (← links)
- Convex hulls of more-part Sperner families (Q1115870) (← links)
- On natural isomorphisms of cycle permutation graphs (Q1115888) (← links)
- Stronger players win more balanced knockout tournaments (Q1116595) (← links)
- On a series of Hadamard matrices of order \(2^ t\) and the maximal excess of Hadamard matrices of order \(2^{2t}\) (Q1117937) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- A generalization of the Katona theorem for cross t-intersecting families (Q1119578) (← links)
- A partition identity on binomial coefficients and its applications (Q1119585) (← links)
- Greatest common subgroups with specified properties (Q1119602) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes (Q1120542) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- New Hadamard matrices and conference matrices obtained via Mathon's construction (Q1120580) (← links)
- On a connection between the existence of k-trees and the toughness of a graph (Q1120590) (← links)
- \(C_ k\)-factorization of complete bipartite graphs (Q1120596) (← links)
- Tight 4 and 5-designs in projective spaces (Q1121267) (← links)
- Some topics in cochromatic theory (Q1121278) (← links)
- On complementary decompositions of the complete graph (Q1121285) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Hybrid triple systems and cubic feedback sets (Q1122578) (← links)
- Slim graphs (Q1123217) (← links)
- The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets (Q1173653) (← links)
- Minimal subschemes of the group association schemes of Mathieu groups (Q1173655) (← links)
- A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656) (← links)
- Point-color-symmetric graphs with a prime number of vertices (Q1173657) (← links)
- Galois correspondence between permutation groups and cellular rings (association schemes) (Q1174111) (← links)
- Polynomial isomorphisms of combinatorial objects (Q1175545) (← links)
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) (Q1175546) (← links)
- Shadows and shifting (Q1175547) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- Character table of a controlling association scheme defined by the general orthogonal group \(O(3,q)\) (Q1175552) (← links)
- Eigenvalues, diameter, and mean distance in graphs (Q1175553) (← links)
- Symmetric edge-decompositions of hypercubes (Q1175554) (← links)
- Perfect graph decompositions (Q1175555) (← links)
- Set systems with no union of cardinality 0 modulo \(m\) (Q1175557) (← links)
- Weighted arcs, the finite Radon transform and a Ramsey problem (Q1175558) (← links)
- Non removable edges in 3-connected cubic graphs (Q1175559) (← links)
- Vosperian and superconnected abelian Cayley digraphs (Q1175561) (← links)
- Rotation numbers for complete tripartite graphs (Q1175562) (← links)
- Interchanging branches and similarity in a tree (Q1175563) (← links)
- Connectivity threshold for random chordal graphs (Q1175564) (← links)
- Flag transitive planes of order \(q^ n\) with a long cycle \(l_ \infty\) as a collineation (Q1175565) (← links)
- The Mann test for divisible difference sets (Q1180431) (← links)
- Construction of spherical 4- and 5-designs (Q1180432) (← links)
- Tutte-Martin polynomials and orienting vectors of isotropic systems (Q1180433) (← links)
- Edge-clique graphs (Q1180434) (← links)
