The following pages link to André E. Kézdy (Q214983):
Displayed 50 items.
- Detour trees (Q277622) (← links)
- Ramsey functions for quasi-progressions with large diameter (Q357459) (← links)
- Petruska's question on planar convex sets (Q776273) (← links)
- (Q807649) (redirect page) (← links)
- Wide posets with fixed height and cutset number (Q807651) (← links)
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling (Q1297493) (← links)
- On extensions of a conjecture of Gallai (Q1362102) (← links)
- Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
- Clique covering the edges of a locally cobipartite graph (Q1567657) (← links)
- Linkage on the infinite grid (Q1641161) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- A finite basis characterization of alpha-split colorings (Q1850023) (← links)
- Heavy transversals and indecomposable hypergraphs (Q1878601) (← links)
- The poset on connected induced subgraphs of a graph need not be Sperner (Q1904390) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- On path-pairability of the finite grids (Q2010412) (← links)
- Eckhoff's problem on convex sets in the plane (Q2049618) (← links)
- Path-pairability of infinite planar grids (Q2052787) (← links)
- Reduction formulas for higher order derivations and a hypergeometric identity (Q2055251) (← links)
- Systems of overlap representation for families of intervals (Q2115149) (← links)
- Note on the bisection width of cubic graphs (Q2197453) (← links)
- All minor-minimal apex obstructions with connectivity two (Q2223478) (← links)
- The path-pairability number of product of stars (Q2312071) (← links)
- Connected matchings in chordal bipartite graphs (Q2339830) (← links)
- Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\) (Q2380263) (← links)
- Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709) (← links)
- \(\rho\)-valuations for some stunted trees (Q2433736) (← links)
- Minimal 2-connected graphs satisfying the even cut condition (Q2656344) (← links)
- The Szemerédi-Petruska conjecture for a few small values (Q2667158) (← links)
- (Q2713606) (← links)
- (Q2721330) (← links)
- (Q2765163) (← links)
- (Q2951140) (← links)
- (Q3433939) (← links)
- On the editing distance of graphs (Q3506314) (← links)
- Do 3n − 5 edges force a subdivision ofK5? (Q3980622) (← links)
- (Q4262254) (← links)
- Distinct Sums Modulo <i>n</i> and Tree Embeddings (Q4330733) (← links)
- (Q4352333) (← links)
- (Q4378523) (← links)
- (Q4378526) (← links)
- (Q4383890) (← links)
- (Q4390687) (← links)
- (Q4393240) (← links)
- (Q4763420) (← links)
- Polynomials that Vanish on Distinct $n$ th Roots of Unity (Q4812339) (← links)
- The 2‐intersection number of paths and bounded‐degree trees (Q4842702) (← links)
- (Q4982948) (← links)
- (Q5412360) (← links)
- A proof of Hougardy's conjecture for diamond-free graphs (Q5948970) (← links)