Pages that link to "Item:Q4320744"
From MaRDI portal
The following pages link to A new series of dense graphs of high girth (Q4320744):
Displaying 50 items.
- On the conjecture for the girth of the bipartite graph \(D(k,q)\) (Q297945) (← links)
- Proof of a conjecture on monomial graphs (Q346278) (← links)
- On the girth of the bipartite graph \(D(k, q)\) (Q400434) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- New results on EX graphs (Q626971) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- On the connectivity of certain graphs of high girth. (Q1426127) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations (Q1869034) (← links)
- A characterization of the components of the graphs \(D(k,q)\) (Q1924372) (← links)
- On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree (Q1949048) (← links)
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator (Q1949050) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs (Q2198988) (← links)
- New bounds on even cycle creating Hamiltonian paths using expander graphs (Q2220967) (← links)
- On the characterization of some algebraically defined bipartite graphs of girth eight (Q2235278) (← links)
- The cardinality of sets of \(k\)-independent vectors over finite fields (Q2385075) (← links)
- Degree Ramsey numbers for even cycles (Q2411600) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
- The implementation of cubic public keys based on a new family of algebraic graphs (Q2442946) (← links)
- On LDPC codes corresponding to affine parts of generalized polygons (Q2442948) (← links)
- Multi-color Ramsey numbers of even cycles (Q2519800) (← links)
- A hierarchy of randomness for graphs (Q2576864) (← links)
- On small world semiplanes with generalised Schubert cells (Q2642616) (← links)
- Covering point-sets with parallel hyperplanes and sparse signal recovery (Q2689251) (← links)
- On the structure of random graphs with constant \(r\)-balls (Q2693149) (← links)
- General properties of some families of graphs defined by systems of equations (Q2757094) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- On Extremal Graphs with Bounded Girth (Q2851535) (← links)
- On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition (Q2960378) (← links)
- On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications (Q2960380) (← links)
- ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE (Q2971040) (← links)
- On the girth of random Cayley graphs (Q3055767) (← links)
- Turán problems for integer-weighted graphs (Q3150169) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- Girth of sparse graphs (Q3651179) (← links)
- (Q4500709) (← links)
